-
21 state machine
-
22 state machine
English-Russian dictionary on household appliances > state machine
-
23 state machine
English-Russian dictionary of terms that are used in computer games > state machine
-
24 state machine
конечный автомат; государственная машинаEnglish-Russian dictionary of technical terms > state machine
-
25 state machine
-
26 state machine
государственный аппарат, государственная машина -
27 state machine
-
28 state machine
-
29 state machine
English-Russian dictionary of computer science > state machine
-
30 state machine diagram: Part of the notation of object-oriented design, used to show the state space of a given class, the events that cause a transition from one state to another, and the actions that result from a state change
Общая лексика: диаграмма конечных авУниверсальный англо-русский словарь > state machine diagram: Part of the notation of object-oriented design, used to show the state space of a given class, the events that cause a transition from one state to another, and the actions that result from a state change
-
31 state of the finite state machine
Программирование: состояние, определённое конечным автоматомУниверсальный англо-русский словарь > state of the finite state machine
-
32 state-machine approach
метод, основанный на теории конечных автоматовБольшой англо-русский и русско-английский словарь > state-machine approach
-
33 state machine diagram
Общая лексика: диаграмма конечных автоматов (часть обозначений объектно-ориентированного проектирования; используется для демонстрации пространства состояний данного класса, событий, вызывающих переход из одного состояния в другое, и действий,) -
34 state machine diagrams
Программирование: диаграммы конечных автоматовУниверсальный англо-русский словарь > state machine diagrams
-
35 state machine modeling
Программирование: моделирование конечного автоматаУниверсальный англо-русский словарь > state machine modeling
-
36 state-machine Petri net
Вычислительная техника: автоматная сеть ПетриУниверсальный англо-русский словарь > state-machine Petri net
-
37 state-machine approach
Вычислительная техника: метод, основанный на теории конечных автоматовУниверсальный англо-русский словарь > state-machine approach
-
38 state-machine classes
Программирование: классы конечных автоматов -
39 state-machine net
Программирование: автоматная сеть -
40 state-machine approach
метод, основанный на теории конечных автоматовEnglish-Russian dictionary of computer science and programming > state-machine approach
См. также в других словарях:
state machine — noun A formalism for describing computation, consisting of a set of states and a transition function describing when to move from one state to another. This algorithm will produce a state machine for parsing a given context free grammar. See Also … Wiktionary
State machine replication — Introduction from Schneider s 1990 survey: : Distributed software is often structured in terms of clients and services. Each service comprises one or more servers and exports operations that clients invoke by making requests. Although using a… … Wikipedia
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
state machine — … Useful english dictionary
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
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
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
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
Virtual finite state machine — The virtual finite state machine (VFSM) is a concept promoted by [http://www.stateworks.com SW Software] and implemented in their StateWORKS product. A VFSM is a finite state machine (FSM) defined in a virtual environment. The VFSM concept… … Wikipedia
Extended finite state machine — In a conventional finite state machine, the transition is associated with a set of input Boolean conditions and a set of output Boolean functions. In an extended finite state machine (EFSM) model, the transition can be expressed by an “if… … Wikipedia