Undergraduate Catalog

COSC 301 Automata, Computability, and Complexity

This course is about fundamental ideas in the theory of computation, including formal languages, computability and complexity. In this standard computer science course, the students will gain the proficiency in the concepts of automata, formal languages, grammar, algorithms, computability, decidability, and complexity.

Credits

3

Prerequisite

COSC101, MATH234

Distribution

2-2-3

Offered

Fall