- permutation automaton
- мат. перестановочный автомат
Большой англо-русский и русско-английский словарь. 2001.
permutation automaton
Смотреть что такое "permutation automaton" в других словарях:
Permutation automaton — In automata theory, a permutation automaton, or pure group automaton, is a deterministic finite automaton such that each input symbol permutes the set of states.[1][2] Formally, a deterministic finite automaton A may be defined by the tuple (S, I … Wikipedia
Permutation City — infobox Book | name = Permutation City title orig = translator = image caption = Cover of first edition (hardcover) author = Greg Egan illustrator = cover artist = country = Australia language = English series = genre = Science fiction novel… … Wikipedia
Garden of Eden (cellular automaton) — An orphan pattern in Conway s Game of Life, discovered by R. Banks in 1971.[1] … Wikipedia
List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… … Wikipedia
Cycle rank — In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close a digraph is to a directed acyclic graph (DAG), in the sense that a … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
Garden of Eden (cellular automata) — In a cellular automaton, a Garden of Eden configuration is a configuration which cannot appear on the lattice after one time step, no matter what the initial configuration. In other words, these are the configurations with no predecessors.They… … Wikipedia
Krohn–Rhodes theory — In mathematics and computer science, Krohn Rhodes theory is an approach to the study of finite semigroups and automata that seeks to decompose them in terms of elementary components. These turn out to correspond to finite aperiodic semigroups and … Wikipedia
Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
