Skip to content
Tape‑n‑Trace
PracticeSearch 26 tools

← All exercises

8 marks · CO1 · ApplyQuestion Bank #15 · Module 1 · Deterministic finite automata

Construct a DFA over Σ = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}

Construct a DFA accepting decimal strings whose value is divisible by 4.

Your machine · over {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}

Click empty space to add a state. Drag one state onto another to connect them. Double-click a state to make it accepting, right-click it to make it the start. Click an edge to edit its label.

q0

States

StateStartAcceptingActions

Transitions (δ)

No transitions yet. Drag from one state to another on the diagram, or use the form above.

Hints3 available