Please enter a regular expression and afterwards click on the start button to start the visualization of the algorithm. The given regular expression will be used as the input of the algorithm.
|
|
Transition in the finite automaton. |
|
|
Edge corresponds to a function call of the algorithm. It is labelled with the regular expression with which the function of the algorithm is called. |
|
|
Function call that is visualized in this step. This edge was replaced by new edges. |
|
|
Edges that were newly added in this step. They correspond to the result of the algorithm's function call. |
|
|
Node that is created after returning from the recursion. Only then, its number is fixed. |
|
|
Node numbered with 2. |
|
|
End node of the finite automaton. |
|
|
Start node of the finite automaton. |