COSC 541 - Automata, Computability and Formal Languages

A survey of the principal mathematical models of computation and formal languages. Finite automata, regular languages and sets, the Chomsky hierarchy, context-free languages, computability and undecidable problems, computational complexity and NP-completeness are studied.

Credit Hours: 3 hrs
Grade Mode: Normal (A-F)

Prerequisite(s):