Toggle navigation
Toolbox
Home
Repository
Issues
Introduction
Convert simple regular expressions to nondeterministic finite automaton.
Supported grammars
r = (s)
r = st
r = s|t
r = s*
r = s+
r = s?
r = ϵ
(Copy this character to input if needed)
Examples
(a|b)*
(a*|b*)*
((ϵ|a)b*)*
(a|b)*abb(a|b)*
Input:
Convert
×
Invalid Grammar
DFA:
https://cyberzhg.github.io/toolbox/nfa2dfa?regex=Yj9hKGJhKSo=
ϵ
ϵ
b
ϵ
ϵ
ϵ
a
ϵ
ϵ
b
a
ϵ
ϵ
0
1
2
3
4
5
6
7
8
9
10
start
URL: