| |
Jan 23, 2026
|
|
|
|
|
MAD 6616 Algebraic Automata Theory Credit Hours: 3
Deterministic and non-deterministic finite automata, Mealy and Moore machines, push-down automata, Turing machines, regular languages, context free languages, halting problem, and universal Turing machines.
Prerequisite(s): None Corequisite(s): None Co-Prerequisite(s): None
USF College of Arts and Sciences | Department of Mathematics and Statistics
Add to Portfolio (opens a new window)
|
|