Problem:

Draw a Turing machine which compare two numbers. The machine must have three accept states. The three labels of the accept states are: $A=B,A>B,$ and respectively.

Use one's for the representation $of$ the two numbers $(for$ example, $3is$ represented $by111$ and $2is11),$ the $0is$ used $to$ separate both numbers, and $B$ means a blank.

The following three examples show the configuration $of$ the machine for: $3=3,$ then, $3>2,$ and finally,