Question

Third time posting, can someone answer please.

Question 2. Consider the Turing machine defined as follows. input alphabet {1} Tape alphabet = { 1,0, x,□} where □ represents a blank Set of states (A, B, C, D Initial state A set of accept states = {D} Transition function: 6(A, z) = (A,z, R) 6(A, □)-(C,D, L) (i) Draw a transition graph for this Turing machine. (ii) Determine the output of the Turing machine for each of the following input i) Give a very brief description of the purpose of this Turing machine.

Answer 1

フ © 1,๐つし 2.0.-ransiten dogam

SOLUTION 2

For iput Stu 1- Follow the qwen tyansiiom dluqram e. lb

8 8 411 eplaced blank e tid accep This s Blank (p)

sorry for this overwriting, where x is replaced by B(blank) in the diagram considered overwriting part as B (blank).

for string 1 output will be 1 (i.e the binary representation of decimal value 1)

for string 11 output will be 10 (i.e the binary representation of decimal value 2)

for string 111 output will be 011(i.e the binary representation of decimal value 3)

for string 1111 output will be 100(i.e the binary representation of decimal value 4)

for string 11111 output will be 101(i.e the binary representation of decimal value 5)  

solution 3

this turning machine counts the number of 1's from the given string and gives the binary representation of count value as output.

from the above example  

for string 11111 it gives output as 101.

the total number of 1's in the above-given string is 5 and the binary representation of 5 is 101 so output will be 101.