CS 305: Theory of Computation

Instructor: Weihao Qu • Monmouth University • Spring 2026

Automata theory and formal languages: finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and computational complexity.

Explained Step-by-step conceptual walkthrough Enhanced Interactive with animations & exercises

Finite Automata

DFA (Deterministic Finite Automata)

Explained Enhanced

NFA (Nondeterministic Finite Automata)

Explained Enhanced

ε-NFA

Explained Enhanced

Regular Languages

Regular Expressions

Explained Enhanced

Pumping Theorem

Explained Enhanced

Context-Free Languages

Context-Free Grammars

Explained Enhanced

Pushdown Automata

Explained Enhanced

Computability & Complexity

Turing Machines

Explained Enhanced

Universal Turing Machine

Explained Enhanced

P vs NP

Explained Enhanced