Every conversion on the sheet, marked as you go.
Five modules, one per lesson, each generating a new machine every time. Tables are marked cell by cell and diagrams are marked by the language they accept — so a machine drawn differently from the answer key still counts, and a machine that is subtly wrong is told which string gives it away.
- 01
5-Tuple & Transition Table
Read a state transition diagram cold and write down (Q, Σ, δ, q₀, F), then build its transition table. DFA and NFA figures both appear, so the shape of a δ cell is part of the question.
Lesson 1 · not started
- 02
Design a DFA or NFA
Given a language in words, draw a machine that accepts it. Marked by comparing languages, not shapes — any correct machine passes, and a wrong one comes back with the exact string it gets wrong.
Lesson 2 · not started
- 03
NFA → DFA
Subset construction, in the order you would write it by hand: discover the composite states, fill the DFA table, then draw the DFA. Includes the dead state everyone forgets.
Lesson 3 · not started
- 04
ε-NFA → NFA
Take every ε-closure, push it through ε*·a·ε*, and work out which states quietly become accepting on the way. That last part is where the marks go.
Lesson 4 · not started
- 05
ε-NFA → DFA
The full pipeline in four marked stages: closures, the NFA table, the DFA table, and the DFA diagram. Each stage is checked before the next unlocks, so an early slip does not silently ruin the rest.
Lesson 5 · not started