Deterministic Finite Machine tester and simulator. Create and Test DFA
Console:
Q0
Add a State Transition
Test Your DFA
String Test Info
DFA Rules
DFA refers to deterministic finite automata. Deterministic refers
to the uniqueness of the computation. The finite automata are
called deterministic finite automata if the machine is read an
input string one symbol at a time.
In DFA, there is only one path for specific input from the current
state to the next state.
DFA does not accept the null move, i.e., the DFA cannot change
state without any input character.