- two-way automaton
- двусторонний автомат двусторонний автомат
Большой англо-русский и русско-английский словарь. 2001.
two-way automaton
Смотреть что такое "two-way automaton" в других словарях:
Two-way deterministic finite automaton — In computer science, a two way deterministic finite automaton (2DFA) is an abstract machine, a generalized version of the deterministic finite automaton (DFA) which can revisit characters already processed. As in a DFA, there are a finite number… … Wikipedia
Automaton — This article is about a self operating machine. For other uses of Automaton, see Automaton (disambiguation) or Automata (disambiguation). An automaton (plural: automata or automatons ) is a self operating machine. The word is sometimes used to… … Wikipedia
Block cellular automaton — The Margolus neighborhood for a two dimensional block cellular automaton. The partition of the cells alternates between the set of 2 × 2 blocks indicated by the solid blue lines, and the set of blocks indicated by the dashed red lines. A block… … Wikipedia
Cellular automaton — A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, theoretical biology and microstructure modeling. It consists of a regular grid of cells , each in one of a finite number of states … Wikipedia
Quantum dot cellular automaton — Quantum Dot Cellular Automata (sometimes referred to simply as quantum cellular automata, or QCA) Any device designed to represent data and perform computation, regardless of the physics principles it exploits and materials used to build it, must … Wikipedia
Garden of Eden (cellular automaton) — An orphan pattern in Conway s Game of Life, discovered by R. Banks in 1971.[1] … Wikipedia
Tree automaton — A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines. The following article deals with branching tree automata, which correspond to regular languages of… … Wikipedia
Pushdown automaton — In automata theory, a pushdown automaton (PDA) is a finite automaton that can make use of a stack containing data. Operation Pushdown automata differ from normal finite state machines in two ways: # They can use the top of the stack to decide… … Wikipedia
Codd's cellular automaton — A simple configuration in Codd s cellular automaton. Signals pass along wire made of cells in state 1 (blue) sheathed by cells in state 2 (red). Two signal trains circulate around a loop and are duplicated at a T junction onto an open ended… … Wikipedia
Second order cellular automaton — A second order cellular automaton is a reversible cellular automaton (CA) where the state of a cell at time t depends not only on its neighborhood at time t 1 , but also on its state at time t 2 . Specifically, the neighborhood at t 1 is used to… … 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
