Skip to content
Tape‑n‑Trace
PracticeSearch 26 tools

← All exercises

8 marks · CO1 · ApplyQuestion Bank #10 · Module 1 · ε-NFAs and ε-closure

Construct an NFA over Σ = {a, b, c}

Obtain an ε-NFA accepting zero or more a's, followed by zero or more b's, followed by zero or more c's.

Your machine · over {a, b, c}

An NFA is fine — it is determinised before comparison.

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.

Hints2 available