- machine-state editor
- редактор, организованный по принципу конечного автомата
Большой англо-русский и русско-английский словарь. 2001.
machine-state editor
Смотреть что такое "machine-state editor" в других словарях:
State University of New York at Brockport — The College at Brockport: State University of New York Motto Expect the Extraordinary! Established 1867 Type Public … Wikipedia
State House elections in Michigan, 2008 — Elections in Michigan Federal government Presidential Elections … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
New York's 99th State Assembly district — State Assembly District 99 Type District of the Lower House Location southern New York Region served parts of Dutchess, Putnam, and Westchester Counties Assemblyman Ste … Wikipedia
Universal Turing machine — This article is a supplement to the article Turing machine. Alan Turing s universal computing machine (alternately universal machine , machine U , U ) is the name given by him (1936 1937) to his model of an all purpose a machine (computing… … Wikipedia
History of Ohio State Buckeyes football — For general information about the team see Ohio State Buckeyes football The history of Ohio State Buckeyes football covers 117 years through the 2006 season. The team has represented the Ohio State University in the Western Conference, its… … Wikipedia
Florence and the Machine — at Brixton Academy in London, 13 December 2009 Background information Origin London, England … Wikipedia
Michigan State University — Motto … Wikipedia
Post–Turing machine — The article Turing machine gives a general introduction to Turing machines, while this article covers a specific class of Turing machines. A Post–Turing machine is a program formulation of an especially simple type of Turing machine, comprising a … Wikipedia
Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… … Wikipedia
Read-only Turing machine — A read only Turing machine or Two way deterministic finite state automaton (2DFA) is class of models of computability that behave like a standard Turing machine and can move in both directions across input, except cannot write to its input tape.… … Wikipedia
