CS 4410 Automata,
Computability and Formal Languages, (3 units).
Finite state concepts; sequential machines and state minimization; Comsky
grammar; algorithms on grammars; computability and Turing machines; non-computable
functions. Prerequisite: CS 4100
COGS HOME