Automata Theory: Advanced Concepts in Information Processing Systems; an Intensive Course for Engineers, Scientists and Mathematicians |
Common terms and phrases
A-formula active module algorithm apply automata Burks C. E. Shannon cell cellular automaton complete component composition concept connected sequence construction contains Corollary decision procedure defined definition delay denoted deterministic embedding equivalent example finite automaton finite set function given ground clauses h-univalent Hence Herbrand universe I-shift idealized automaton infinite behavior infinite sequence initial input sequence instruction assembly iterative circuit computers l'-sequence Lemma logical memory assembly multiplexed Neumann object composition operation ordinary transmission element output P-module pair algebra partition predicate primitives probabilistic probabilistic automaton problem proj projection proof set Q-projections real-time real-time computation recursive Reduced Form Algorithm RELAY resolution principle result s₁ s₂ satisfy semi-deterministic sequential machines set of clauses set systems signal storage register sub-composition subset sequence switch symbols t(uv t₂ tape terminal tion transition transition relation Turing machine uniquely solvable variables wires zero