Comprehensive theory of computation reference covering finite automata (DFA, NFA), regular expressions and languages, context-free grammars, pushdown automata, Turing machines, decidability, complexity classes (P, NP, NP-complete), and reductions for analyzing computational limits. 5 pages | 35 formulas | Topics: Finite Automata, Regular Languages, Context-Free Grammars, Turing Machines, Complexity | Course codes: CS 374, CSCI 3102, CSE 355, EECS 376, CSCE 433 Print-ready PDF. Available in A4 and US Letter sizes. Instant download after purchase.