hw3 - languages generated by such grammars are regular. 3....

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
University of Central Florida School of Computer Science COT 4210 Spring 2004 Prof. Rene Peralta Homework 3 Due date: Feb. 25 1. (with apologies to the class) Consider the language L 1 generated by the following grammar S AB + C A aB + C B Ab + C C b + aaaC Characterize L 1 using a combination of set notation and regular ex- pressions. 2. Consider context-free grammars whose derivation rules have at most one non-terminal on the right hand side. Prove or disprove that the
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the 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 dened in the statement of the Myhill-Nerode theorem) of the language generated by the following automaton. 1 2...
View Full Document

Page1 / 2

hw3 - languages generated by such grammars are regular. 3....

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online