The exam is closed book. You are allowed to bring
- 1 sheet of 8.5" by 11.0" piece of paper with notes written on it
- Pencil or pen
- eraser
What's covered by the exam.
- Anything in Chapter 11 of the text book.
- Anything in Chapter 12, Section 12.1
- Anything in the published notes, through last Thursday, April 21, 2011.
- Anything covered by any of the Homeworks (including proofs by induction, and proofs by contradiction).
- Anything we talked about in class
Topics you should know
- Definitions of formalisms
- Regular Language
- Regular Expression
- DFA
- NFA
- NFAe
- GenNFA
- Regular Grammar
- Context Free Langauge
- Context Free Grammar
- Context Free Expression
- Skills
- Translating word descriptions of a language into any of the formalisms
- Using properties of Regular Expressions (Table 11.1, page 700)
- Executing DFA's by hand over a string
- Algorithms
- RegExp to Finite automaton
- Top Down (via GenNFA, 11.4, page 711)
- Bottom up (11.7, page 729)
- Finite automaton to RegExp (via GenNFA, 11.5, page 713) state ripping.
- Computing Lambda-closures (page 732)
- NFA to DFA (subset construction, 11.8, page 733-734)
- Minimum State DFAs (11.10, page 740)
- NFA to RegGrammar (11.11 page 748, also see the Notes on Regular Grammars).
- RegGrammar to NFA (11.2 page 750)
- Combining Context Free Grammars (12.3, page 761)
- Other topics
- Closure properties of Regular languages
- Applyng the pumping-lemma to prove a language is not regular.