CS 181 - Automata Theory

---

Table of contents

• 1 - DFA
• 11 - Turing Equivalent Models
• 14 - Decidability
• 2 - Nondeterminism
• 3 - Closure
• 4 - Regular Expressions
• 5 - Non-Regularity
• 6 - Context-Free Grammar
• 7 - Pushdown Automata
• 8 - Non-context-free Grammar