Finite Automata Simulator

Runs and tests your DFA or NFA and generates diagram for the machine and flowchart for input!

Q: Set of states

Separate states with a semicolon

Σ: Alphabet

Separate the symbols with a semicolon

q0: Initial State

State not found in Q. NFA won't recognise non-empty strings.

F: Set of accept (final) states

Separate states with a semicolon

Click this load button to prepare the transition function table for input

δ: Transition Function

Click on the cells to enter next states (separated by a semicolon). Leave blank for an empty set

δ ε 0 1
a
b

Test strings

Separate strings with semicolons

101 verified