CMPS 5313 - Automata Theory
3 (3-0)
Prerequisite(s): CMPS 2433.
The study of deterministic and non-deterministic finite automata. Formal languages and grammars including Chomsky’s Hierarchy, regular and context free grammars, pushdown automata, Turing machines, and computability.
Click here for the Fall 2024 Schedule of Classes
Click here for the Spring 2025 Schedule of Classes
Add to Catalog (opens a new window)
|