F
Finite State Machine
Build and run finite state machines — define states, transitions, and test input strings.
Algorithms
v1.0.0
87 uses
F
Finite State Machine
Esc
or
Ctrl+Shift+F
to exit
State
—
Step
0
Result
—
About This Simulator
Design your own finite state machine interactively. Add states, define transitions between them, mark accept states, and then feed input strings to watch the machine process them character by character. The current state highlights in real time as each input symbol is consumed. Great for understanding regular languages, parsers, and state-based logic.
How It Works
- 1 Load a preset FSM or build your own
- 2 Enter an input string in the text field
- 3 Click Run to watch the FSM process the input step by step
- 4 Green states are accept states — if the machine ends there, input is accepted
- 5 Click Step to advance one character at a time
- 6 Try different inputs to see which strings the machine accepts
More Simulators in Algorithms
D
Database B-Tree
AlgorithmsVisualize how databases use B-Trees for indexing — insert keys and watch the tree split and grow.
R
Recursion Tree
AlgorithmsVisualize recursive function call trees for Fibonacci, factorial, and more.
H
Hash Table
AlgorithmsVisualize hash table insertions, lookups, and collision resolution strategies.