xutil.dev
Login

Automaton Simulator

Simulate DFA and NFA state machines online — define states, transitions, and test string acceptance step by step. Free computer science learning tool for automata theory

DFA Definition
Format:
start: <start state>
accept: <accept states> (comma-separated)
<state>, <symbol> -> <next state>
Transition Table
State01
q0q0q1
q1q2q0
*q2q1q2
Test Execution
q01
q10
q21
q20
q1
Rejected