Enter a regular expression ('*', '|' and '()' supported). The usable alphabet is shown above the input box. Tick 'Make a Graph' to enable or disable graph generation. The generated graph is deterministic finite state automata. Once the (correct) expression is parsed, it is possible to simulate the automata by entering a accepted or non-accepted word in the lower input box.
| Alphabet: | |
| Regular Expression: | |
| Word: | |
| Make a Graph: |
Reload