CS Vis
Algorithms
Turing Machine
DFA
NFA
About
Contact
CS Vis
✕
Turing Machine
DFA
NFA
Algorithms
Graphs & Trees
Sorting
Searching & Arrays
Dynamic Programming
Divide & Conquer
Greedy Algorithms
About
Contact
Deterministic Finite Automaton
Share
Editor
Documentation
Save
Load
Reset
# DFA — accepts binary strings that end in '01' # Alphabet: {0, 1} states: q0: transitions: - symbol: '0' to: q1 - symbol: '1' to: q0 q1: transitions: - symbol: '0' to: q1 - symbol: '1' to: q2 q2: transitions: - symbol: '0' to: q1 - symbol: '1' to: q0 alphabet: ['0', '1'] startState: q0 acceptStates: [q2]
Fix the configuration error to see the state diagram.