Computer Science
and Engineering

CSE 4111

Automata and Computability

Course director: Zbigniew Stachniak

Course Description: ``This course is the second course in the theory of computing. It is intended to give students a detailed understanding of the basic concepts of abstract machine structure, information flow, computability, and complexity. The emphasis will be on appreciating the significance of these ideas and the formal techniques used to establish their properties. Topics chosen for study include: models of finite and infinite automata, the limits to computation, and the measurement of the intrinsic difficulty of computational problems.'' [from the Department of Computer Science and Engineering Undergraduate Calendar, 2008/09]

J. Hopcroft, R. Motwani, and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.

Course Directory:

All course related information (e.g. lecture notes, assignments, sample tests, etc.) can be found in

Course Work:

For information on assignments, midterm and final tests as well as their deadlines follow this link.

Questions: If you have any questions, send an email to the course director