Automata theory: advanced concepts in information processing systems; an intensive course for engineers, scientists and mathematicians
39 pages matching tape in this book
Results 1-3 of 39
What people are saying - Write a review
We haven't found any reviews in the usual places.
active module apply automata bits Bound Lemma Burks C. E. Shannon cell cellular automaton complete component composition concept connected sequence consists construction contains Corollary corresponding decision procedure defined definition delay denoted deterministic embedding equivalent error example finite automaton finite set first-order logic formulas function given ground clauses Hence Herbrand universe idealized automaton infinite behavior infinite sequence initial input sequence instruction assembly iterative circuit computers Lemma logical M-formula memory assembly multiplexed Neumann nodes object composition operation ordinary transmission element output P-module pair algebra parameter partition predicate primitives probabilistic automaton problem proj projection proof set pulse real-time real-time computation recursive Reduced Form Algorithm resolution principle result satisfy semi-deterministic sequential machines set of clauses set systems signal space storage register sub-composition sub-programs subset sequence switch symbols t(uv tape terminal theory tion transition relation Turing machine uniquely solvable variables wires zero