NSYSU CSE Course: Computational Theory

• P. Linz, An Introduction to Formal Languages and Automata, 4th Edition, Johns and Bartlett, ISBN: 0763737984
• J. Hopcroft, R. Motwani, and J. Ullman, Introduction to Automata Theory, Languages and Computation, 2nd Edition

• Homework 1: 1.1.1, 1.2.1, 1.3.4, 2.1.1, 2.2.1, 2.3.1, 2.4.1, 3.1.1, 3.2.1, 3.3.1
• Midterm (ps) 04/30/2007 2:30-4:30

• Preliminary (ps)
• Finite Automata (ps)
• Regular Expression (ps)
• Context-Free Grammar (ps)
• Pushdown Automata (ps)
• Turing Machine (ps)
• Undecidability (ps)
• Intractability (ps)