Chapter 1

Finite Automata

Deterministic Finite Automata (DFA)

medium • 1 min read

Non-deterministic Finite Automata (NFA)

medium • 2 min read

Equivalence of DFA and NFA

medium • 3 min read

Minimization of DFA

medium • 4 min read

Finite automata with output (Moore and Mealy machines)

medium • 5 min read

Chapter 2

Regular Expressions

Regular expressions and regular languages

medium • 1 min read

Identity rules

medium • 2 min read

Arden's theorem

medium • 3 min read

Pumping lemma for regular languages

medium • 4 min read

Closure properties

medium • 5 min read

Chapter 3

Context-Free Grammars

Context-free grammars (CFG)

medium • 1 min read

Derivation trees and ambiguity

medium • 2 min read

Simplification of CFG

medium • 3 min read

Chomsky Normal Form (CNF)

medium • 4 min read

Greibach Normal Form (GNF)

medium • 5 min read

Chapter 4

Pushdown Automata

Definition of Pushdown Automata (PDA)

medium • 1 min read

Acceptance by final state and empty stack

medium • 2 min read

Equivalence of CFG and PDA

medium • 3 min read

Pumping lemma for context-free languages

medium • 4 min read

Closure properties of CFLs

medium • 5 min read

Chapter 5

Turing Machines

Definition and model of Turing Machine (TM)

medium • 1 min read

Design of TMs

medium • 2 min read

Computable functions

medium • 3 min read

Types of Turing Machines

medium • 4 min read

Decidability and Halting problem

medium • 5 min read