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
- Spring '08
- Formal languages, Regular language, Nondeterministic finite state machine, Formal grammar, Automata theory, minimal DFA