AutomataLab v1.0

Finite Automata & Regular Languages Visualizer / Automate Finis & Langages Réguliers

Finite Automata & Regular Languages

Explore deterministic (DFA) and nondeterministic (NFA) state machines, step through input string processing in real-time, test subset construction, and run Hopcroft's DFA minimization.

String Simulation Input

Speed:
String Progress:
Current State: q0
Ready

Batch String Test Suite

DFA Graph View
Drag states to arrange

Execution Trace Log

Step State Read Symbol Next State Accepting?
Made with Alchimist · Report