Syllabus for QUIZ 2

Topics and Sample Questions for Quiz 2: (Chapters 1, 2,3, 4 and 5 of the Textbook)
• Languages
• Give the formal definition of a language
• Operations on languages (complement, intersection, concatenation, power, reverse, star-closure)
• Grammars
• Give the formal definition of a grammar
• Give the formal definition of a regular grammar
• Give the formal definition of a context free grammar
• Give the formal definition of equivalence of two grammars
• Give a grammar that produces the following language ...
• Describe the language generated by the grammar below ...
• DFAs
• Give the formal definition of a DFA
• Give the formal definition of the language accepted by a DFA
• Give a DFA that accepts the following language ...
• Describe the language accepted by the DFA below ...
• Minimize the (number of states of the) DFA below ...
• NFAs
• Give the formal definition of a NFA
• Give the formal definition of the language accepted by a NFA
• Give an NFA that accepts the following language ...
• Describe the language accepted by the NFA below ...
• Convert the NFA (with lambda transitions) below into a DFA ...
• Regular Expressions
• Give the formal definition of a regular expression
• Give the formal definition of a language associated with a regular expression
• Give a regular expression for the following language ...
• Describe the language for the following regular expression ...
• Convert the regular expression below into a NFA ...
• Convert the DFA/NFA below into a regular expression ...
• Regular Languages
• Give the formal definition of a regular language
• Existance of an algorithm to check membership, to test whether the language is empty, finite/infinite, and to determine whether two languages are equal
• Prove that the following regular language is regular (show a DFA, NFA, regular expression, regular grammar) ...
• Prove that the following language is not regular (using closure properties or pumping lemma) ...
• Context Free Languages
• Give the formal definition of a context free language
• Prove that the following language is context free (show a context free grammar) ...

NOTE: The list above is representative of the problems that could be on the quiz, but not necessarly exhaustive