- regular automaton
- мат. правильный [регулярный] автомат
Большой англо-русский и русско-английский словарь. 2001.
regular automaton
Смотреть что такое "regular automaton" в других словарях:
Regular expression — In computing, a regular expression provides a concise and flexible means for matching (specifying and recognizing) strings of text, such as particular characters, words, or patterns of characters. Abbreviations for regular expression include… … Wikipedia
Regular language — In theoretical computer science, a regular language is a formal language (i.e., a possibly infinite set of finite sequences of symbols from a finite alphabet) that satisfies the following equivalent properties: * it can be accepted by a… … Wikipedia
Regular grammar — Strictly regular grammars = In computer science, a right regular grammar (also called right linear grammar) is a formal grammar ( N , Σ, P , S ) such that all the production rules in P are of one of the following forms: # A → a where A is a non… … Wikipedia
regular expression — n. wild card pattern used by Unix utilities; any pattern containing symbols and three operators; class of strings that can be recognized by a finite state automaton … English contemporary dictionary
Probabilistic automaton — In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the non deterministic finite automaton; it includes the probability of a given transition into the transition function, turning it into a transition… … Wikipedia
ω-automaton — In automata theory, a branch of theoretical computer science, an ω automaton (or stream automaton) is a deterministic or nondeterministic automaton that runs on infinite, rather than finite, strings as input. Since ω automata do not stop, they… … Wikipedia
Omega-regular language — The ω regular languages are a class of ω languages which generalize the definition of regular languages to infinite words. Büchi showed in 1962 that ω regular languages are precisely the ones definable in a particular monadic second order logic… … Wikipedia
Büchi automaton — A Büchi automaton is the extension of a finite state automaton to infinite inputs. It accepts an infinite input sequence iff there exists a run of the automaton (in case of a deterministic automaton, there is exactly one possible run) which… … Wikipedia
Complementation of Büchi automaton — In automata theory, complementation of a Büchi automaton is construction of another Büchi automaton that recognizes complement of the ω regular language recognized by the given Büchi automaton. Existence of algorithms for this construction proves … Wikipedia
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
Tree walking automaton — A tree walking automaton (TWA) is a type of finite automaton that deals with tree structures rather than strings.The following article deals with tree walking automata. For a different notion of tree automaton, closely related to regular tree… … Wikipedia
