This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: languages generated by such grammars are regular. 3. There is an erroneous statement at http://en.wikipedia.org/wiki/Myhill-Nerode Theorem. Find it and explain what is wrong with it. 4. Find the number of equivalence classes (as deﬁned in the statement of the Myhill-Nerode theorem) of the language generated by the following automaton. 1 2...
View Full Document
- Spring '08
- Computer Science, Formal language, Formal grammar, Prof. Rene Peralta, Consider context-free grammars