DFA Simulator

Design, Visualize, and Simulate Deterministic Finite Automata

1. Define DFA

States (comma separated, e.g., q0, q1):

Alphabet (comma separated, e.g., 0, 1):

Start State:

Accepting States (comma separated):

Transitions

2. Simulate

Input String:

Speed:

Step 0 of 0

Current: -

Input Progress:

Remaining: -

Path Taken

Start State Current State Accept State

About DFA

A Deterministic Finite Automaton (DFA) is a finite state machine that accepts or rejects strings of symbols. For each state and input symbol, there is exactly one next state.

How to Use

Define states and mark start/accepting states
Add transitions between states
Enter an input string and simulate

Default Example

The default DFA accepts all strings over {0,1} that end with "01". Try inputs like "1101", "01", "1010" to see the simulation.