3.00 Credits
Presents an introduction to automata, formal languages computability, and computational complexity. Topics include finite automata, pushdown automata, context-free grammars, Turing machines, and algorithmically unsolvable and computationally intractable problems. The course is intended for students interested in the mathematical foundations of computer science theory.