Question

Describe a TM (Turing Machine) which accepts the language L = {w2w | w is a string in {0, 1}* }. Here I mean informally describe how the TM works. You need not give the full program or diagram.

Answer 1

A Turing Machine is the scientific device identical to an advanced PC. It was proposed by the mathematician Turing in the 30s, and has been from that point forward the most generally utilized model of calculation in process ability and many-sided quality hypothesis.

The model comprises of an information yield connection that the machine registers. The information is given in paired frame on the machine's tape, and the yield comprises of the substance of the tape when the machine ends.

At each progression, the present state and the character read on the tape decide the following state the FSM will be in, the character that the machine will yield on the tape (perhaps the one read, leaving the substance unaltered), and which bearing the head moves in, left or right.

Here a string w of 0's and 1's ought to have the property that, the no of 0's in the string w ought to be separable by 3 ( N(0) % 3 =0 ), and the quantity of 1's the string w ought to be detachable by 5 (N(1) % 5 =0).

Having said that, the Language will contain the strings, for example, : { ε , 000, 11111, 00011111, 00111101 , 11111000, 10101011 , 00000011111,… .thus on }

Thus, strings acknowledged by the machine must be of length 0, 3, 5, 8, 11, 13, 14, 16… .etc so on, i.e. condition for length will be 3x + 5y (where x,y>=0 )

Modulo 3 gives leftover portion as ( 0, 1, 2 ) , and Modulo 5 gives leftover portion as ( 0, 1, 2, 3, 4 ). Consequently 3 * 5 satiates, i.e. there will be 15 states in the machine to speak to this. It was proposed by the mathematician Turing in the 30s, and has been from that point forward the most generally utilized model of calculation in process ability and many-sided quality hypothesis.

The model comprises of an information yield connection that the machine registers. The information is given in paired frame on the machine's tape, and the yield comprises of the substance of the tape when the machine ends.

At each progression, the present state and the character read on the tape decide the following state the FSM will be in, the character that the machine will yield on the tape (perhaps the one read, leaving the substance unaltered), and which bearing the head moves in, left or right.

Here a string w of 0's and 1's ought to have the property that, the no of 0's in the string w ought to be separable by 3 ( N(0) % 3 =0 ), and the quantity of 1's the string w ought to be detachable by 5 (N(1) % 5 =0).

Having said that, the Language will contain the strings, for example, : { ε , 000, 11111, 00011111, 00111101 , 11111000, 10101011 , 00000011111,… .thus on }

Thus, strings acknowledged by the machine must be of length 0, 3, 5, 8, 11, 13, 14, 16… .etc so on, i.e. condition for length will be 3x + 5y (where x,y>=0 )

Modulo 3 gives leftover portion as ( 0, 1, 2 ) , and Modulo 5 gives leftover portion as ( 0, 1, 2, 3, 4 ). Consequently 3 * 5 satiates, i.e. there will be 15 states in the machine to speak to this.