Course Description:
Advanced topics in automata theory, grammars, Turing machines, decidability, and algorithmic complexity.Prerequisite:
- C or higher in CS 3358: Data Structures
- C or higher in Discrete Math II (MATH 3398)
Course Objectives:
- Regular languages and finite automata.
- Context-Free languages and pushdown automata.
- Turing Machines.
Course Notes:
None.
Section Info:
Lecture/Lab Hours: 3 hours lecture, 0 hours lab
Offered: Very frequently (typically Fall).