Automata and Formal Language Theory
This is the catalog page for CIS . Below you will find a brief description of
this course and its details. Also listed below are scheduled classes of this course. For a more detailed class schedule,
please view the Full Class Schedule.
Course Description
Finite-state automata and regular expressions, context-free grammars and pushdown automata, Turing machines, computability and decidability, and complexity classes. AS Course Details
Attached Syllabi
CIS Classes for Summer 9-Week 2007
Lectures
No classes scheduled for this course during this semester.
|