Read: Finite Automata — DFA, NFA, ε-NFA
Start with the chapter spine
Open practice dock
Drills and weak-topic replay
Study library
Search all imported chapters
Theory of Computation
Continue from the last thing you actually touched, instead of hunting through the registry again.
ContinueNo assignments matching your criteria.
Try a broader filter or jump back to the course hub to browse the full assignment set.
Finite Automata — DFA, NFA, ε-NFA
Deep dive into patterns and axioms.
NFA to DFA Conversion — Subset Construction
Deep dive into patterns and axioms.
Regular Expressions & Pumping Lemma
Deep dive into patterns and axioms.
Regular Expression to DFA — Direct Conversion and Properties
Deep dive into patterns and axioms.
DFA Minimization and Pumping Lemma
Deep dive into patterns and axioms.
Context-Free Grammars
Deep dive into patterns and axioms.
CFG to PDA Conversion and PDA to CFG
Deep dive into patterns and axioms.
Pushdown Automata
Deep dive into patterns and axioms.
Turing Machines — Definition, Variants, Church-Turing Thesis
Deep dive into patterns and axioms.
Turing Machine Variants & Church-Turing Thesis
Deep dive into patterns and axioms.
Decidability — Undecidable Problems, Halting Problem
Deep dive into patterns and axioms.
Reductions — Proving Undecidability
Deep dive into patterns and axioms.
Time & Space Complexity
Deep dive into patterns and axioms.