Formal Languages and Automata Theory

Catalog description

Presents abstract models of computers (finite automata, pushdown automata and Turing machines) and the language classes they recognize or generate (regular, context-free and recursively enumerable). Also presents applications in compiler design, algorithms and complexity theory. Restricted to Computer Science M.S. (8071), Software Engineering M.S. (8050), Cybersecurity M.S. (8099) and Computer Science Ph.D. (9071) students. Other students need approval from the instructor. Recommended: Background equivalent to CSE 2010 Algorithms and Data Structures .