-
101 finite state machine
English-Russian big polytechnic dictionary > finite state machine
-
102 finite-state language
descriptive language — дексриптивный язык; описательный язык
English-Russian big polytechnic dictionary > finite-state language
-
103 finite-state machine
English-Russian big polytechnic dictionary > finite-state machine
-
104 finite-state grammar
грамматика с конечным числом состояний; автоматная грамматикаEnglish-Russian information technology > finite-state grammar
-
105 finite-state language
English-Russian information technology > finite-state language
-
106 finite-state machine
English-Russian information technology > finite-state machine
-
107 finite state automation
domestic automation — бытовые автоматы, бытовая автоматика
English-Russian dictionary of Information technology > finite state automation
-
108 finite state machine
English-Russian dictionary of Information technology > finite state machine
-
109 finite-state grammar
English-Russian dictionary of Information technology > finite-state grammar
-
110 finite-state language
English-Russian dictionary of Information technology > finite-state language
-
111 finite-state machine
English-Russian dictionary of Information technology > finite-state machine
-
112 finite-state automaton
English-Russian dictionary of computer science > finite-state automaton
-
113 finite-state grammar
English-Russian dictionary of computer science > finite-state grammar
-
114 finite-state machine
English-Russian dictionary of computer science > finite-state machine
-
115 finite-state mashine
English-Russian dictionary of electronics > finite-state mashine
-
116 In an object-oriented model, the state-dependent aspects of a system are defined by means of one or more finite state machines, where each finite state machine is encapsulated inside its own object
Общая лексика: В объектно-ориентированной модели зависящие от состУниверсальный англо-русский словарь > In an object-oriented model, the state-dependent aspects of a system are defined by means of one or more finite state machines, where each finite state machine is encapsulated inside its own object
-
117 A finite state machine is a conceptual machine with a finite number of states. It can be in only one of the states at any specific time
Универсальный англо-русский словарь > A finite state machine is a conceptual machine with a finite number of states. It can be in only one of the states at any specific time
-
118 Gibbs finite state
конечное состояние ГиббсаАнглийский-русский словарь по теории вероятностей, статистике и комбинаторике > Gibbs finite state
-
119 The object's finite state machine is depicted by means of a statechart
Программирование: Конечный автомат объекта изображается в виде диаграммы состояний (см. Designing Concurrent, Distributed, and Real-Time Applications with UML by Hassan Gomaa)Универсальный англо-русский словарь > The object's finite state machine is depicted by means of a statechart
-
120 deterministic finite state machine
Вычислительная техника: детерминированный конечный автоматУниверсальный англо-русский словарь > deterministic 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