RegToy

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.

aJust one character
abcCharacters in sequence
ab|cdAlternatives
a*Repetition, 0 or more
b+Repetition, 1 or more
(a|bb)*Parentheses for grouping things

(0|1)*0Binary numbers that are multiples of two
(a|b)*aa(a|b)*Strings of a's and b's containing consecutive a's
(a|b)*ab(a|b)*
((ac|b)*|bd)a

Thomas Hallgren