CS 4410 - Automata, Computability, and Formal Languages
(3 Units) Finite state concepts; sequential machines and state minimization;
Chomsky grammar; algorithms on grammars; computability and Turing
machines; non-computable functions.Prerequisites: CS 4100.(Spring)
