| |
| |
May 18, 2025
|
|
|
|
|
CSCE 5400 - Automata Theory3 hours
Deterministic and non-deterministic finite automata, regular expressions and sets, context-free grammars and pushdown automata. Turing machines as acceptors, enumerators and computers. Church’s thesis, universal Turing machines and the halting problem, the Chomsky hierarchy and intractable problems.
Prerequisite(s): CSCE 3110 or equivalent.
Add to My Catalog (opens a new window)
|
|
|
|
