Southern Polytechnic State University
Department of Computer Science
Theory of Computation
Fall 2008
Name:
123
Homework for Chapter 06
Pushdown Automata
(due Wed, 29/Oct/2008)
Please answer the following questions.
1) [HMU, page 245, exercise 6.3.2]
Convert the grammar
S aAA
A aS | bS | a
to a PDA that accept the same language by empty stack.
2) [HMU, page 246, exercise 6.3.6]
Show that if P is a PDA, then there is a one-state PDA P1 such that N(P1) = N(P).
3) [HMU, page 251, exercise 6.4.2 (b)]
Give deterministic pushdown automata to accept the following languages:
b) { 0n1m | n m }
Bibliography
[HMU] J.E. Hopcroft, R. Motwani, J.D. Ullman, Introduction to Automata
Theory, Languages, and Computation, 2nd Edition, Addison Wesley. 2001.
Page 1 of 1