AUTOMATA:THEORY OF COMPUTATION

Catalog description

Provides an introduction to the theoretical foundations of computing. Topics include: automata and languages (finite automata, regular languages, and context-free languages), computability theory (the Church-Turing thesis and decidability), and complexity theory (time and space complexity). Emphasis on the use of rigorous mathematical approaches to problem definition and description of solutions. Prerequisites: MATH-170 and CS-311 , both with a grade of C or higher.