CSC 42800 Formal Languages and Automata
Classes of languages; their description in terms of grammars and their recognition by automata. The Chomsky hierarchy; regular, context-free, context-sensitive and recursively enumerable languages. Application to parsing and compiler construction.
Contact Hours
3 hr./wk.