Introduction to Theory of Computation
Section A Fall Z. Stachniak Tue, Thu 14:30-16:00
Section M Winter X. Deng Tue, Thu 10:00-11:30
Section N Winter M. Wharton Mon, Wed 17:00-18:30
The course will introduce the different theoretical
models of computers. Topics covered may include the
- Finite automata and regular expressions. Practical
applications eg. text editors
- Pushdown automata and context-free grammars.
Practical applications eg. parsing and compilers.
- Turing machines. Turing machines as a general
model of computers. Introduction to the halting
problem and NP completeness.
Texts: Cohen, Introduction to Computer Theory.