This course gives a theoretical and mathematical treatment of the fundamental computational models which are useful in the design of algorithms and programming languages. The material will be covered in the style of a formal, abstract mathematics course.
Prerequisite: CSE213.
Textbook: Peter Linz, An Introduction to Formal Languages and Automata, 1996 (2nd edition), D.C. Heath, Lexington, Massachusetts.
| Homework 1 (Extended till Sep. 24) | |
| Homework 2 (Due October 8) | |
| Homework 3 (Extended till November 10th) | |
| Homework 4 (Due December 8th) |
| Prof. Ker-I Ko | |
| Office hours: 3:45 - 5:15pm Tuesday, 3:45 - 5:00pm Thursday, Room 2424 |
| Maxim Lifantsev | |
| Office hours: 1:00 - 2:00pm, Tuesday, Thursday, Room 1210 |
| Last updated on Oct. 04, 1998 by Maxim Lifantsev |