Question: Make a Turing machine which computes the difference of two strings 3 Make a Touring machine which compute the diference of two strings -> On
Make a Turing machine which computes the difference of two strings

3 Make a Touring machine which compute the diference of two strings -> On the tape you have as input" 0^{m}10^{n} symbols ( where symbol '^' means power) '' -> as a result you get: 0^{m-n} 3.a Get an example for an 'm' and 'n' choosen by you (for example m=2, n=1 which means that on the Touring tape you have the string '000100'; there can not be two similar examples) for your example and show how the Touring machine works for your choosen 'm' and 'n; 3.b Write in words the rules for the functioning of your Touring machine
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
