CSCI 8666
Automata, Computability and Formal Languages

This course presents a sampling of several important areas of theoretical computer science. Definition of formal models of computation and important properties of such models, including finite automata and Turing machines. Definition and important properties of formal grammars and their languages. Introduction to the formal theories of computability and complexity.

Credit

3 semester hours

Prerequisites

MATH 2030. Recommended: CSCI 3320.

Cross-listed as

CSCI-4660, MATH-4660, MATH-8666, MATH-8306