Convert Between Automata and Regular Expressions
This tool demonstrates the step-by-step process of converting between different representations of regular languages.
Step 1: Original NFA
We start with a nondeterministic finite automaton (NFA).
Original NFA
q₀
1
q₁
0,1
q₂
0
0,1
States: q₀, q₁, q₂
Alphabet: {0, 1}
Start state: q₀
Accept states: q₂
Transitions:
- δ(q₀, 0) = q₀
- δ(q₀, 1) = q₁
- δ(q₁, 0) = q₂
- δ(q₁, 1) = q₂
- δ(q₂, 0) = q₂
- δ(q₂, 1) = q₂
Step 1 of 3