This preview shows page 1. Sign up to view the full content.
Unformatted text preview: production rules S --> aS | bA | c | λ A --> aA | bA | bB B --> bA | bB | aC | c C --> aB | cS | aC | λ • 5 -Sudkamp, Problem 4, p. 217. • 6 -Sudkamp, Problem 11, a and b, p. 218. Show how to build the required DFAs and prove that your method works. • 7 -Sudkamp, Problem 14 b, d, and e, p. 218. Remember, what has to be shown is that there is no way to pick the substrings so that the Pumping Lemma is satisfied. NOTE: Your problem solutions are due at 5:00 of the due date....
View Full Document
This note was uploaded on 05/12/2011 for the course CS 4114 taught by Professor Ehrich,r during the Spring '08 term at Virginia Tech.
- Spring '08