Fifteenth Lecture
Monday, October 30
PDAs
Greibach Normal Form
Review of algorithm.
Form is useful to connect to pdas.
Nondeterministic pushdown automata
Saw informally before. Formal definitions as in Kozen.
Acceptance by final state, and by empty stack.
Illustration of use.