Explore curated automata examples. Click any example to load it directly into the simulator.
Even Parity Checker - accepts binary strings with even number of 0s AND even number of 1s. Demonstrates state-based counting. Try: "11001010"
String Suffix Recognizer - accepts strings ending with "ab". Demonstrates epsilon transitions and non-deterministic state choices. Try: "aabab"
Balanced Parentheses Checker - validates that all opening parentheses "(" have matching closing ")" in correct order using stack. Try: "((()()))"
a^n b^n Language Recognizer - accepts strings with equal numbers of "a"s followed by equal "b"s (e.g., "aaabbb"). Classic context-free language. Try: "aaaabbbb"
Balanced Parentheses Verifier - checks if parentheses are properly nested using tape operations (read/write/move). Try: "(()())()"
Binary Number Adder - performs addition of two binary numbers using tape operations. Demonstrates computational power of TMs. Try: "101c101"
"101" Pattern Detector - outputs 1 when detecting "101" sequence, 0 otherwise. Output is generated on transitions (during state changes). Try: "100101"
"101" Pattern Detector - outputs 1 when "101" is detected. Output is associated with states (not transitions), demonstrating state-based output. Try: "010011010"
Start with a blank canvas and design your own automata from scratch
Open Simulator