DFA (Deterministic Finite Automaton)
Create, visualize, and test deterministic finite automata
Example DFAs
Even number of 0s
Accepts strings with even number of 0s
Ends with 'ab'
Accepts strings ending with 'ab'
Binary divisible by 3
Accepts binary numbers divisible by 3
States (0)
Alphabet (0)
Initial
Trans (0)
States0
ΣAlphabet0
Transitions0
No transitions added yet
Add states and alphabet symbols first