The course presents a study of formal languages and the correspondence between language classes and the automata that recognize them. Formal definitions of grammars and acceptors, deterministic and nondeterministic systems, grammar ambiguity, finite state and push-down automata, and normal forms will be discussed.
Prerequisites: MATH 3134 or MATH 3034. (3H,3C)
See: course web pages.
Taught By: Roger Ehrich