-
121 deterministic finite-state automaton
Техника: детерминированный конечный автоматУниверсальный англо-русский словарь > deterministic finite-state automaton
-
122 dynamic model: A view of a problem or system in which control and sequencing is considered, either within an object by means of a finite state machine or by consideration of the sequence of interaction among objects
Общая лексика: динамическая модель: представлениУниверсальный англо-русский словарь > dynamic model: A view of a problem or system in which control and sequencing is considered, either within an object by means of a finite state machine or by consideration of the sequence of interaction among objects
-
123 enhanced finite-state machine
Универсальный англо-русский словарь > enhanced finite-state machine
-
124 in one of the states of the finite state machine
Программирование: в одном из состояний, определённых конечным автоматомУниверсальный англо-русский словарь > in one of the states of the finite state machine
-
125 nondeterministic finite state machine
Вычислительная техника: недетерминированный конечный автоматУниверсальный англо-русский словарь > nondeterministic finite state machine
-
126 nondeterministic finite-state automaton
Техника: недетерминированный конечный автоматУниверсальный англо-русский словарь > nondeterministic finite-state automaton
-
127 object's finite state machine
Программирование: конечный автомат объектаУниверсальный англо-русский словарь > object's finite state machine
-
128 finite automaton
= finite automation; = FA Iконечный автомат, КАобщее обозначение конечного автомата - без уточнения, является ли он детерминированным (DFA) или нет (NFA) - см. finite state machineАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > finite automaton
См. также в других словарях:
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Finite state grammar — [ faɪnaɪt steɪt ɡræmə; englisch »Grammatik mit endlich vielen Zuständen«], Sprachwissenschaft: Modell von Grammatiken, die eine unendliche Menge von Sätzen mithilfe einer endlichen Menge von rekursiven Regeln über einem endlichen Wortschatz… … Universal-Lexikon
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
Finite state transducer — A finite state transducer (FST) is a finite state machine with two tapes: an input tape and an output tape. This contrasts with an ordinary finite state automaton (or finite state acceptor), which has a single tape. OverviewAn automaton can be… … Wikipedia
Finite-State-Machine — Abb.1 Beispiel eines EA Ein endlicher Automat (EA, auch Zustandsmaschine, englisch finite state machine (FSM)) ist ein Modell des Verhaltens, bestehend aus Zuständen, Zustandsübergängen und Aktionen. Ein Automat heißt endlich, wenn die Menge der… … Deutsch Wikipedia
Finite State Machine — Abb.1 Beispiel eines EA Ein endlicher Automat (EA, auch Zustandsmaschine, englisch finite state machine (FSM)) ist ein Modell des Verhaltens, bestehend aus Zuständen, Zustandsübergängen und Aktionen. Ein Automat heißt endlich, wenn die Menge der… … Deutsch Wikipedia
finite state machine — baigtinis automatas statusas T sritis automatika atitikmenys: angl. finite automaton; finite state machine vok. endlicher Automat, m; Finalautomat, m rus. конечный автомат, m pranc. automate final, m; automate fini, m; automate terminal, m;… … Automatikos terminų žodynas
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
Nondeterministic finite-state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
Nondeterministic finite state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
Event-driven finite state machine — In computation, a finite state machine (FSM) is event driven if the creator of the FSM intends to think of the machine as consuming events or messages. This is in contrast to the parsing theory origins of the term finite state machine where the… … Wikipedia