Finite Automata
δ Transition Table
NFA → DFA (Subset)
DFA Minimize
DFA Minimize (Visual)
DFA Equivalence
NFA Computation Tree
ε-Closure Table
Dead State Analysis
Pushdown Automata
NPDA Simulation
NDTM Simulation
Regular Grammars
DFA/NFA → Regular Grammar
Regular Grammar → NFA
Turing Machines
UTM Simulator
TM → Grammar
MTM Transition Table
Transducers
Moore Table (λ:
Q→Δ)
Mealy Table (λ:
Q×Σ→Δ)
Moore → Mealy
Mealy → Moore
Regular Expressions
Regex → NFA (Thompson)
Regex → NFA (Visual)
NFA → Regex (GNFA)
Transformations
ε-NFA → NFA
DFA Complement
Product Construction
Decision Properties
Is Empty?
Is Finite?
Is Universal? (DFA)
Full Equivalence
Closure Operations
Kleene Star (NFA)
Reversal (NFA)
Union with M₂
Intersection with M₂
Concat with M₂