Question: Draw a Turing machine that takes a string representing two unary numbers, and , separated by a 0, and determines whether . For example, the
Draw a Turing machine that takes a string representing two unary numbers, and , separated by a 0, and determines whether . For example, the input for = 3, = 4 would be 11101111. Use two halt states: one for yes and one for no.
Give the trace of your machine in the previous problem processing the strings 11101111 and 11110111.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
