What is the minimum number of states required by a Turing Machine to accept strings which consist of even number of 1's?
What is the minimum number of states required by a Turing Machine to accept strings which consist of even number of 1's? Correct Answer 2
The correct answer is option 3.
Concept:
The given problem is an even number of 1's.
It accepts the 2 states for DFA.
[ alt="F1 Harshita11-2-22 Savita D20" src="//storage.googleapis.com/tb-img/production/22/02/F1__Harshita11-2-22_Savita_D20.png" style="width: 255px; height: 126px;">
A Turing Machine must have at least two states:
one that accepts input and one that rejects it. Because the machine cannot accept and reject at the same time, the accepting and rejecting states must be separate. As a result, at least two states are required.
You can't accept anything when you're in a single state. The transition of a Turing Machine is (X, Y, R/L). With a single state, you'll have to define at least one transition, which will almost certainly contain R/L. As a result, the Turing Machine will never cease moving, either right or left or oscillating between the two.
[ alt="F1 Harshita11-2-22 Savita D21" src="//storage.googleapis.com/tb-img/production/22/02/F1__Harshita11-2-22_Savita_D21.png" style=" width: 256px; height: 119px;">
Hence the correct answer is 2.