-
1 вспомогательный полуавтомат
Mathematics: auxiliary semiautomatonУниверсальный русско-английский словарь > вспомогательный полуавтомат
-
2 гомоморфный полуавтомат
Mathematics: homomorphic semiautomatonУниверсальный русско-английский словарь > гомоморфный полуавтомат
-
3 недетерминированный полуавтомат
Mathematics: nondeterministic semiautomatonУниверсальный русско-английский словарь > недетерминированный полуавтомат
-
4 перестановочный полуавтомат
Mathematics: permutation semiautomatonУниверсальный русско-английский словарь > перестановочный полуавтомат
-
5 подобный группе полуавтомат
Mathematics: grouplike semiautomatonУниверсальный русско-английский словарь > подобный группе полуавтомат
-
6 полуавтомат
1) Military: semi-automatic weapon2) Engineering: partly automatic machine, semiautomated machine (станок), semiautomatic device, semiautomatic machine3) Mathematics: semiautomaton4) Sowing: mechanized sewing unit5) Makarov: semi-automatic machine6) Electrochemistry: semi-automat -
7 циклический полуавтомат
Mathematics: cyclic semiautomatonУниверсальный русско-английский словарь > циклический полуавтомат
-
8 вспомогательный полуавтомат
Русско-английский научно-технический словарь Масловского > вспомогательный полуавтомат
-
9 гомоморфный полуавтомат
Русско-английский научно-технический словарь Масловского > гомоморфный полуавтомат
-
10 недетерминированный полуавтомат
Русско-английский научно-технический словарь Масловского > недетерминированный полуавтомат
-
11 перестановочный полуавтомат
Русско-английский научно-технический словарь Масловского > перестановочный полуавтомат
-
12 подобный группе полуавтомат
Русско-английский научно-технический словарь Масловского > подобный группе полуавтомат
-
13 циклический полуавтомат
cyclic semiautomaton мат.Русско-английский научно-технический словарь Масловского > циклический полуавтомат
См. также в других словарях:
Semiautomaton — In mathematics and theoretical computer science, a semiautomaton is an automaton having only an input, and no output. It consists of a set Q of states, a set Σ called the input alphabet, and a function T: Q × Σ → Q called the transition function … Wikipedia
semiautomaton — noun a multiplicative operation of a monoid on a set … Wiktionary
Semigroup action — In algebra and theoretical computer science, an action or act of a semigroup on a set is a rule which associates to each element of the semigroup a transformation of the set in such a way that the product of two elements of the semigroup (using… … Wikipedia
Automata theory — Automata is defined as a system where energy, information and material is transformed, transmitted and used for performing some function without the direct participation of man .In theoretical computer science, automata theory is the study of… … Wikipedia
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
Act — or ACT may mean:* Act of Parliament (Act of Congress in the USA) a statute or law passed by a legislature. * Act (band), a British band * ACT New Zealand, a New Zealand political party * Act (document), a document recording the legality of a… … Wikipedia
State transition table — In automata theory and sequential logic, a state transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finite semiautomaton or finite state machine will move to, based on the current state … 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
List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… … Wikipedia
Quantum finite automata — In quantum computing, quantum finite automata or QFA are a quantum analog of probabilistic automata. They are related to quantum computers in a similar fashion as finite automata are related to Turing machines. Several types of automata may be… … Wikipedia
Probabilistic automaton — In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the non deterministic finite automaton; it includes the probability of a given transition into the transition function, turning it into a transition… … Wikipedia