CS4384 - Automata Theory

CS 4384 Automata Theory (3 semester credit hours) A review of the abstract notions encountered in machine computation. Deterministic and nondeterministic finite automata; regular expressions, regular sets, context-free grammars, pushdown automata, context-free languages. Selected topics from Turing Machines and undecidability. Prerequisite: (CE 2305 or CS 2305) with a grade of C or better. (3-0) S