- Palindrome Detector for strings of 0's and 1's
             - A is Start State; Z is Accept State
(A,1, ,B,R)  - detect 1 - store as state B
(A,0, ,C,R)  - detect 0 - store as state C
(A, , ,Z,R)  - empty string - done! (even number) 
(B,0,0,B,R)  - go right
(B,1,1,B,R)
(B, , ,D,L)  - end of string detected - go back
(C,0,0,C,R)  - go right
(C,1,1,C,R)
(C, , ,E,L)  - end of string detected - go back
(D,1, ,F,L)  - found 1, cancel it, & go back 
(D, , ,Z,L)  -   or found blank - done! (odd number)
(E,0, ,F,L)  - found 0, cancel it & go back
(E, , ,Z,L)  -   or found blank - done! (odd number)
(F,0,0,F,L)  - go back 
(F,1,1,F,L)
(F, , ,A,R)  - beginning of string detected