Course Details

MAD 6616: Algebraic Automata Theory

College of Arts and Sciences: School of Natural Sciences and Mathematics | Department of Mathematics and Statistics

Description:	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.
Credit Hours:	3
Prerequisites:	None
Corequisites:	None
Co-Prerequisites:	None
Course Requirements:	None
Other Information:	None