How can we construct TMs such that it accepts(Give description only):a + b = ca . b = cInput is of the form a#b#c. a,b and c belongs to {0,1}* and are positive binary unsigned integers.I know that we can construct TMs if the input has unary representation but how to solve if it has binary representation?
How to construct this turing machine?
turing machines;automata