This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Nerode Theorem. Is this a better theorem than the Pumping Lemma? j. What if a PDA has two stacks? (Any corresponding grammar? Any interesting examples of languages that can be parsed with two stacks that can’t be parsed with one stack?) [Reference: p. 81 of Wayne Goddard’s textbook.] k. What is an L±system? (Sometimes called a Lindenmayer system. Demo in JFLAP.) l. Write or find on the internet a Java function to calculate the Ackermann function defined on page 329 of your text. Demo it for Questions 8 and 14 on p. 333. Name and letter taken: Bachmann __ I ___; Das _____; Diehl _____; Doyle _____; Mitchell __ A ___; Pesner __ L ___; Soderberg±Rivkin __ K ___; Townsend __ absent ___; Veronda __ absent ___. B, G, H are taken by Das, Diehl and Doyle in some order. Towsend and Veronda should pick one of J or C&F. First to email me with their request from one of those two options gets it....
View Full Document
- Spring '08
- Computer Science, Formal language, NPDA, L-system, Diehl, Anil Nerode characterize