STATE MACHINE SIMULATION

▸ Building the state diagram & transition table…
▸ Loading DFA machines (pattern · divisibility · gate · vending)
▸ Loading the timed machine (traffic light)
▸ Loading the NFA + ε-moves (many parallel states)
▸ Generating the input string & calibrating the token…
▸ Ready — Online. ✅
0%
⌂ Mind & Machine

Simulation room Finite state machine

Finite State Machine & Regex
Online
state · transition · DFA/NFA · regex
State & string
🔤 Pattern matcher "01"
Current state—
Consumed—
Remaining—
Result—
Machine size—
Viewing—
Notes
A finite state machine remembers only "which state am I in" among a FINITE number of states. It reads a string of symbols and, following a transition table, jumps between states — exactly as powerful as a regular expression (regex).
—
Pick a ‘Scenario’ to change machine (pattern · light · vending · gate · div-by-3 · NFA) · 🎲 new string to watch it run again · click a concept/machine for details
Your browser has canvas disabled.
String consumption progress & live state count over time readlive states
About Finite State Machine

Finite State Machine is one of 20 topics in the Mind & Machine domain (bit → AI scale) at My Labs — an interactive simulation atlas. This virtual lab runs right in your browser: adjust the parameters, pick a scenario and watch the phenomenon change in real time, with a click-to-inspect cross-section for every structure.

Related topics in Mind & Machine