## Theory of Computing: A Gentle Introduction |

## Theory of Computing: A Gentle Introduction |

We haven't found any reviews in the usual places.

alphabet arrow labeled automata automaton accepting binary cell Chomsky normal form Church-Turing thesis computational problems concatenation construct contains context-free grammar context-free languages defined in Section definition derivation deterministic finite automaton deterministic pushdown automaton Dom(f empty stack End Proof equivalence classes erasable Exercise favorable Figure finite state diagram formally function f functional property given grammar G graph G halts Hamiltonian cycle implemented initial input string input tape Kleene star language L(G leftmost length loop M'P-complete marker move natural numbers node nondeterminism nondeterministic finite automaton nondeterministic Turing machine nonregular nonterminal one-tape operation output palindromes parse tree partial Turing computable polynomial-time reductions polynomially bounded programming language pumping lemma pushdown automaton reading head reading the input regular expression regular language represented rule second tape semidecidable sequence set of transitions simulate solving step subset substring Suppose symbol Theorem transformed Turing computable function Turing enumerable undecidable word