Home▸Algorithms & AI▸Automata Theory: Finite-State Machine Visualizer

🔤 Automata Theory: Finite-State Machine Visualizer

Watch a deterministic finite automaton read an input string symbol by symbol: states light up, transitions animate, and the machine accepts or rejects live in 3D.

Algorithms & AI3DEasy60 FPS

Details

CategoryAlgorithms & AI

RenderingThree.js · WebGL

DifficultyEasy

Target FPS60

ControlsAutomaton preset buttons (Ends with 01 / Even # of 0s / Contains 11) swap the DFA; input text field sets the binary string being read; Play/Pause, Step and Reset buttons control the animation; Random button generates a new string; speed slider (0.5-6 symbols/s) sets playback rate.

Three.jsfinite automatonDFAformal languagesInstancedMesh

Related simulations

3D Boids — Flocking500 agents in 3D space following Reynolds' rules: separation, alignment, cohesion. Emergent…

Ant Colony Pheromone Trails SimulationExplore the fascinating world of ant colonies as you observe how they use pheromone trails…

Pathfinding — A*, Dijkstra, BFSDraw walls, generate mazes and watch A*, Dijkstra, Greedy Best-First and BFS explore the… ⊞ All 343 in Algorithms & AI →

⚙ Under the hood

Step a deterministic finite automaton through a binary input string one symbol at a time: the active state lights up, transitions animate along curved 3D arcs, and the machine accepts or rejects live. Switch between three classic DFAs — strings ending in 01, an even count of 0s, and strings containing 11.

Three.jsfinite automatonDFAformal languagesInstancedMesh

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install