⟨ TURING.MACHINE ⟩
🏅 Palindrome
🏅 Binary+1
🏅 aⁿbⁿ
SIMULATOR
PROGRAM
CHALLENGES
INPUT:
palindrome
aⁿbⁿ
binary+1
TAPE
▶ PLAY
⟩ STEP
↺ RESET
STEP:
0
STATE:
q0
SPEED
5
STATE DIAGRAM
TRANSITION LOG
TRANSITION FUNCTION δ(state, symbol) → (new_state, write_symbol, direction)
STATE
READ
WRITE
MOVE
NEXT STATE
+ ADD RULE
✓ SAVE
CHALLENGES — EARN BADGES
○
🎯 PALINDROME RECOGNIZER
Build a TM that accepts strings which read the same forwards and backwards (e.g. "abba", "aba"). Try with input: abba
○
🎯 aⁿbⁿ RECOGNIZER
Accept strings with equal numbers of a's followed by equal b's: ab, aabb, aaabbb. Requires careful state design!
○
🎯 BINARY INCREMENT
Add 1 to a binary number written on the tape. e.g. 1011 → 1100. Handle carry propagation!
CONTINUE