CS 340 - Formal Languages and Automata Theory

3 credit(s)
This course introduces formal aspects of describing and recognizing languages using grammars and automata. Covers abstract models (finite automata, push-down automata and Turing machines) and the language classes they recognize or generate (regular, context-free and recursively enumerable). Also presents applications of these models to compiler design, algorithms and complexity theory.
Prerequisite(s): CS 115 and M 221W.
Laboratory fee.

Click here for Fall 2024 course scheduling information.

Click here for Spring 2025 course scheduling information.