Chapter 1

Regular Expressions

Finite automata

medium • 1 min read

DFA

medium • 2 min read

NFA

medium • 3 min read

E-NFA

medium • 4 min read

Myhill-Nerode theorem

medium • 5 min read

Chapter 2

Context-Free Grammars

Pushdown automata

medium • 1 min read

Derivation trees

medium • 2 min read

Ambiguity

medium • 3 min read

Chomsky normal form

medium • 4 min read

Pumping lemma for CFL

medium • 5 min read

Chapter 3

Recursive Languages

Turing machines

medium • 1 min read

Universal Turing machine

medium • 2 min read

Multi-tape machines

medium • 3 min read

Nondeterministic TM

medium • 4 min read

Enumeration

medium • 5 min read

Chapter 4

Decidability

Halting problem

medium • 1 min read

Rice's theorem

medium • 2 min read

Post correspondence problem

medium • 3 min read

Recursive vs RE

medium • 4 min read

Undecidability proofs

medium • 5 min read

Chapter 5

Language Hierarchy

Chomsky hierarchy

medium • 1 min read

Regular vs Context-free

medium • 2 min read

Recursive vs Context-sensitive

medium • 3 min read

Closure properties

medium • 4 min read

Decision properties

medium • 5 min read

Chapter 6

Automata Equivalence

FA to RE

medium • 1 min read

RE to FA

medium • 2 min read

DFA minimization

medium • 3 min read

PDA for CFG

medium • 4 min read

TM for grammar

medium • 5 min read

Chapter 7

Memory-Bounded Machines

Linear bounded automata

medium • 1 min read

Context sensitive languages

medium • 2 min read

Two-way PDA

medium • 3 min read

DCFL

medium • 4 min read

State complexity

medium • 5 min read

Chapter 8

Tractable Computations

Logspace

medium • 1 min read

P-space

medium • 2 min read

Exptime

medium • 3 min read

Savitch's theorem

medium • 4 min read

Hierarchy theorems

medium • 5 min read