About this document
Theory of Computation Exam Guide by Aravind Suresh is a document available to read on EtoBox.
This document provides a crib sheet for the Theory of Computation exam covering regular languages and finite automata, context-free languages and pushdown automata. Some key points include: - Regular languages can be recognized by regular expressions, regular grammars, deterministic finite automata (DFAs), or nondeterministic finite automata (NFAs). They are closed under various operations. - The pumping lemma can be used to prove languages are not regular. There are decision procedures for problems about f
- Author
- Aravind Suresh
- Language
- EN