# # A simple DTM to check whether the binary input word is a # palindrome. # # (w) 2006, Michal Januszewski tapes = 1 alphabet = { 0, 1 } states = { init, one_0, one_1, zero_0, zero_1, yes, no, bs } istate = init fstates = { yes, no } tape_0 = 00110101100 # Transition function tf = init 1 -> one_0 b R init 0 -> zero_0 b R init b -> yes b R one_0 0 -> one_0 0 R one_0 1 -> one_0 1 R one_0 b -> one_1 b L zero_0 0 -> zero_0 0 R zero_0 1 -> zero_0 1 R zero_0 b -> zero_1 b L one_1 1 -> bs b L one_1 0 -> no b L one_1 b -> yes b L zero_1 1 -> no b L zero_1 0 -> bs b L zero_1 b -> yes b L bs 0 -> bs 0 L bs 1 -> bs 1 L bs b -> init b R