quantum finite automata
11QFA — Quantum Finite Automata (Computing » General) **** Qeshm Free Area (Governmental) **** Qeshm Free Area (Regional) * Quality Fitness in Ayrshire (Community » Sports) * Quantum Financial Advisors, Inc. (Business » Firms) * Quest For Al Qa eda… …
12Read-only Turing machine — A read only Turing machine or Two way deterministic finite state automaton (2DFA) is class of models of computability that behave like a standard Turing machine and can move in both directions across input, except cannot write to its input tape.… …
13Semiautomaton — 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 …
14Квантовый робот — Квантовый робот  гипотетическое квантовое устройство, представляющее собой подвижную квантовую наносистему со встроенным квантовым компьютером и системами взаимодействия с окружающей средой[1]. Первую модель квантового робота предложил Поль… …
15QFA — may stand for:* Qantas Airlines * Quantum finite automata * Qualified Financial Adviser Republic of Ireland …
16Probabilistic 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… …
17Zweiwege-DFA — In der Informatik ist ein Zweiwege deterministischer endlicher Automat (Zweiwege DFA, 2DFA) ein Automat, genauer gesagt ein deterministischer endlicher Automat (DFA), der bereits gelesene Zeichen noch einmal besuchen kann. Wie im DFA gibt es auch …
18Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… …
19Block cellular automaton — The Margolus neighborhood for a two dimensional block cellular automaton. The partition of the cells alternates between the set of 2 × 2 blocks indicated by the solid blue lines, and the set of blocks indicated by the dashed red lines. A block… …
20Richard Feynman — Feynman redirects here. For other uses, see Feynman (disambiguation). Richard P. Feynman Richard Feynman at Fermilab Bor …
