ICS 441: Theory of Computation

Description: Grammars, sequential machines, equivalence, minimalization, analysis and synthesis, regular expressions, computability, unsolvability, Gödel’s theorem, Turing machines.


Course Learning Outcomes: See objectives.

Program Learning Outcomes

Prerequisites: 311 or consent

Textbook(s): “Introduction to Automata Theory, Languages, and Computation,” John E. Hopcroft and Jeffrey D. Ullman

Grading: A few assignments (100%) in which students have to solve given theoretical problems and write technical reports on their solutions to the given problems, where the last assignment is the take-home final exam