CSCE 433/627 Formal Languages and Automata / Theory of Computability
Spring 14

Instructor: Sing-Hoi Sze
Email: shsze@cse.tamu.edu
Meeting: TR 8-9:15 HRBB 113
Office Hours: TR 9:15-10:15 HRBB 328B or by appointment


Textbook

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

Goal

This course studies formal models of computation and the relationships between them. The course will focus on the question "what is computable" versus "what is not computable" in each model.

Topics

Grading

Prerequisites