-
81 finite-state grammar
Англо-русский словарь компьютерных и интернет терминов > finite-state grammar
-
82 finite-state language
Англо-русский словарь компьютерных и интернет терминов > finite-state language
-
83 finite-state machine
Англо-русский словарь компьютерных и интернет терминов > finite-state machine
-
84 finite state machine
English-Russian dictionary of modern telecommunications > finite state machine
-
85 finite state automation
English-Russian dictionary of terms that are used in computer games > finite state automation
-
86 finite state machine
English-Russian dictionary of terms that are used in computer games > finite state machine
-
87 finite-state grammar
English-Russian dictionary of terms that are used in computer games > finite-state grammar
-
88 finite-state language
English-Russian dictionary of terms that are used in computer games > finite-state language
-
89 finite-state machine
English-Russian dictionary of terms that are used in computer games > finite-state machine
-
90 finite state machine
Программирование; ПО Конечный автомат Программа, которая имеет возможность переключения между различными состояниями и выполнения разных действий в разных состояниях.English-Russian dictionary of computer abbreviations and terms > finite state machine
-
91 finite-state grammar
автоматная грамматика, регулярная грамматикаАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > finite-state grammar
-
92 finite state model
-
93 finite state system
-
94 finite-state automaton
English-Russian scientific dictionary > finite-state automaton
-
95 finite-state channel
English-Russian scientific dictionary > finite-state channel
-
96 finite-state grammar without homonymy
English-Russian scientific dictionary > finite-state grammar without homonymy
-
97 finite-state machine
мат.English-Russian scientific dictionary > finite-state machine
-
98 finite state grammar
автоматная грамматика; грамматика с конечным числом состоянийlist grammar — списочная грамматика; списковая грамматика
-
99 finite state language
-
100 finite state machine
См. также в других словарях:
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