Некатегоризованные страницы

Перейти к навигации Перейти к поиску

Ниже показано до 50 результатов в диапазоне от 2041 до 2090.

Просмотреть ( | ) (20 | 50 | 100 | 250 | 500)

  1. Reachability graph
  2. Reachability matrix
  3. Reachability problem
  4. Reachability relation
  5. Reachable (from a) vertex
  6. Reachable marking
  7. Reaching matrix
  8. Reaching set
  9. Realizable admissible sequence
  10. Realization of a hypergraph
  11. Realizer of P
  12. Reasonable numbering
  13. Receiver
  14. Recognizer
  15. Reconstructible graph
  16. Reconstruction of a graph
  17. Rectangular graph
  18. Recursive nonterminal symbol
  19. Recursive set
  20. Recursively enumerable language
  21. Recursively enumerable set
  22. Redex
  23. Reduced graph
  24. Reduced hypergraph
  25. Reduced path covering
  26. Reducible additive hereditary graph property
  27. Reducible by Hecht and Ullman flow graph
  28. Reduction tree
  29. Reflexive-transitive closure of a graph
  30. Reflexive graph
  31. Reflexive relation
  32. Region of connectivity
  33. Register-interference graph
  34. Regressive bounded graph
  35. Regressive finite graph
  36. Regular Petri net
  37. Regular Petri net with finite marking
  38. Regular basic subnet
  39. Regular expression
  40. Regular expression nonequivalence problem
  41. Regular graph
  42. Regular group of a graph
  43. Regular language
  44. Regular loop
  45. Regular matroid
  46. Regular set
  47. Regular tournament
  48. Regularizable graph
  49. Relation
  50. Relation precedence

Просмотреть ( | ) (20 | 50 | 100 | 250 | 500)

Источник — http://pco.iis.nsk.su/grapp/index.php/Служебная:Некатегоризованные_страницы