CSE 364 Formal Languages and Automata Theory

Prof M Akif Eyler

Classification of automata and formal languages. Finite state machines, regular languages and their limitations. Tape automata. Push-down automata and context-free languages. Normal-form grammars. Context-sensitive languages. Turing machines, halting problem and unsolvability. NP completeness. (Prerequisite: MATH 257)

Textbook
Hopcroft, Motwani, Ullman, Introduction to Automata Theory, Addison Wesley, 2001

Grading
Midterm 30%
Assignments 30%
Final 40%
Books and notes closed

Weekly Outline
Feb 27 1. Languages and Automata
Mar 6 2. Finite Automata Asg 1
Mar 13 2. Non-deterministic Finite Automata
Mar 20 3. Regular Expressions Asg 2
Mar 27 4. Regular Languages
Apr 3 4. Language Properties Asg 3
Apr 10 (midterm)
Apr 17 5. Context-Free Languages
Apr 24 6. Pushdown Automata Asg 4
May 1 8. Turing Machines
May 8 9. Undecidability Asg 5
May 15 10. Decision Problems, Classes P and NP
May 22 10. NP completeness: results and examples Asg 6
May 29 Review

Web design: Erdinç Yilmazel
Last update: Feb 2006