CS 4393/5393, Automata Theory
Course Description
Study formal languages and equivalent models of computation;
finite state automata and regular expressions; push-down automata and
context-free grammars; pumping lemmas and closure properties; and
Turing machines.
Prerequisite
CS 3363
(Data Structures).
Scheduling
This course is offered in the spring semester of even-numbered years.
Offerings
Spring 2008, Section 001 Huang, X. TR 12:30-01:45 CSM 211