Automata Theory: Advanced Concepts in Information Processing Systems; an Intensive Course for Engineers, Scientists and Mathematicians
46 pages matching tape in this book
Results 1-3 of 46
What people are saying - Write a review
We haven't found any reviews in the usual places.
1'-sequence apply automata Bound Lemma Burks C. E. Shannon cell cellular automaton complete component composition concept connected sequence construction contains Corollary corresponding decision procedure defined definition delay denoted deterministic deterministic sequence embedding equivalent error example exists finite automaton finite set formulas function given ground clauses Hence Herbrand universe idealized automaton infinite behavior infinite sequence initial input sequence instruction assembly Lemma logical M-formula memory assembly multiplexed Neumann nodes object composition operation ordinary transmission element output pair algebra parameter partition periodic pulser predicate primitives probabilistic automaton problem proj projection proof set pulse Q-projection real-time computation recursive Reduced Form Algorithm resolution principle result satisfy semi-deterministic sequence of P-states sequential machines set of clauses set systems signal space square sub-composition subset sequence switch symbols T-sequence t(uv tape terminal theory Time-shift Theorem tion transition relation Turing machine uniquely solvable variables wires zero