Finite Automaton Visualizer
Interactive finite automaton simulator. Build and step through DFA and NFA state machines, trace input strings, and see how finite automata underpin regex engines and network protocol parsers.
By Mohamed Habib Jaouadi•September 1, 2025•
Post Related
#automata
#finite-automaton
#dfa
#nfa
#formal-languages
#theory
Finite Automaton: Accepts strings ending in "ab"
A DFA with 3 states. Enter a string of a's and b's to simulate.
Input:
→ Start state◎ Accept state (double circle)