CSc I2400 Formal Language Theory

Classification of languages by grammars and automata. The Chomsky hierarchy: regular, context free, context sensitive and recursively enumerable languages and their associated grammars and automata. Closure properties for families of languages. Decision problems for grammars and automata.

Credits

3

Prerequisite

CSC 30400 or CSc I2000 or equivalent.

Contact Hours

3 hr./wk.