next up previous contents
Next: Turing Machines Up: Properties of context-free languages Previous: Properties of context-free languages

halting digression

Finiteness is intimately related to halting, somehow. Multiple stacks in a pushdown automata make it equivalent to a Turing Machine.



root
6/8/1998