ITCS 4107 - Formal Languages and Automata

Detailed study of abstract models for the syntax of programming languages and information processing devices. Languages and their representation; grammars, finite automata and regular sets; context-free grammars and pushdown automata; Chomsky Hierarchy; closure properties of families of languages; syntax analysis.

Credit Hours: (3)
Prerequisite(s): MATH 1165 or ITSC 2175.