Skip to content
Draw
tomata
: automata, grammar and parsing conversions, step by step
Automata
Grammars
& PDA
Parsing
Compiler
λ
ε
RE → FA
Draw FA
Language → DFA
Pumping lemma
Grammar ⇄ FA
CFG & PDA
Parsing
SDT
Lexer
Code gen
New here?
Pick a tool above and type your own input, or try one:
Regex → minimal DFA
NFA → DFA
LL(1) table
Compiler phases
×
Start drawing
Press
S
and click to add a state, or pick an example.
V
H
S
A
E
Remove λ
NFA → DFA
Minimize
FA → RE
Right-linear G
Left-linear G
Test strings
Describe L
Examples
Examples
DFA: even number of a's
NFA: ends with ab
DFA: contains 01
λ-NFA: a*b*
DFA with equivalent states
Export PNG
Export SVG
Save as .json
Open .json
Clear canvas
100%
0 states
·
Saved
State name
Start
Final
Symbols
Save