This Regular Expression Toy allows you to enter a regular expression and view its translations to a NFA (Nondeterministic Finite Automaton) and a DFA (Deterministic Finite Automaton).
The examples below illustrate the supported regular experssion syntax.
- a Just one character
- abc Characters in sequence
- ab|cd Alternatives
- a* Repetition, 0 or more
- b+ Repetition, 1 or more
- (a|bb)* Parentheses for grouping things
- (0|1)*0 Binary numbers that are multiples of two
- (a|b)*aa(a|b)* Strings of
a's andb's containing consecutivea's - (a|b)*ab(a|b)*
- ((ac|b)*|bd)a