Final Exam
Time and Location
Topics to be Covered
- Topics from the Test
In particular,
Recursive Definition,
Structural (General) Induction,
Regular Languages and Regular Expressions,
Conversion of NFA-Lambda to NFA
Conversion of NFA to DFA
- Kleene Theorem 1
- Complement and Intersection of Regular Languages
- Non-Regularity Test (Myhill-Nerode i.e. Corollary 5.1)
- Contex-Free Language, PDA
- Turing Machines, and
Combination of Turing Machines
- Unsolvable Problems