Unformatted text preview: Practice Problems Solve problems 2.7, 2.26, 2.30(b) and 2.30(c) Homework Problems Problem 1 . [Category: Design] Design a pushdown automaton to recognize the language in problem 2.23. You need not formally prove the correctness of your construction, but your construction should be clear and understandable, giving the intuition behind the states and the stack symbols and how the PDA works. Problem 2 . [Category: Proof] Solve problem 2.35. Problem 3 . [Category: Proof] 1. Solve problem 2.31. 2. Solve problem 2.45. 1...
View Full Document
- Fall '08
- Homework Problems Problem, Practice Problems Solve