CS 5342 - Concepts of Language Theory and Their Applications

Credits: 3

Formal languages and their relation to automata; introduction to finite-state automata, context-free languages, and Turing machines; theoretical capabilities of each model; applications in terms of grammars, parsing, and operational semantics; and decidable and undecidable problems about computation. Prerequisite: C- or better in CS 3342 or permission of instructor.