EECS 510: Introduction to the Theory of Computing (3)

Finite state automata and regular expressions. Context-free grammars and pushdown automata. Turing machines. Models of computable functions and undecidable problems. The course emphasis is on the theory of computability, especially on showing limits of computation. May be taken for graduate credit. (Same as MATH 510.) Prerequisite: EECS 210 and upper-level EECS eligibility. LEC
View current sections...