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.
-
Notifications
You must be signed in to change notification settings - Fork 0
SeamusHerrod/EECS-510-Intro-Theory-of-Computing
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published