autómata
121Anatoly Shalyto — Infobox Scientist name = Anatoly Shalyto image width = 200px caption = birth date = Birth date and age|1948|5|28|mf=y birth place = Leningrad, USSR death date = death place = residence = flag|USSR, flag|Russia citizenship = nationality =… …
122List of PSPACE-complete problems — Here are some of the more commonly known problems that are PSPACE complete when expressed as decision problems. This list is in no way comprehensive. Games and puzzles Generalized versions of: Amazons· Atomix· Geography· Gomoku· Hex· Reversi·… …
123Complementation of Büchi automaton — In automata theory, complementation of a Büchi automaton is construction of another Büchi automaton that recognizes complement of the ω regular language recognized by the given Büchi automaton. Existence of algorithms for this construction proves …
124Constraint automaton — In computer science, Constraint automata are a formalism to describe the behavior and possible data flow in coordination models[1]. It was introduced by Arbab et al.[2] as a variation of finite automata for model checking Reo connector circuits.… …
125Nondeterministic 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 …
126John von Neumann — Von Neumann redirects here. For other uses, see Von Neumann (disambiguation). The native form of this personal name is Neumann János. This article uses the Western name order. John von Neumann …
127A New Kind of Science —   Author(s) Stephen Wolfram Country …
128Moore machine — In the theory of computation, a Moore machine is a finite state machine, whose output values are determined solely by its current state.  Contents 1 Name 2 Formal definition 3 Visual representation …
