Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
What is the minimum number of states required by a Turing Machine to accept strings which consist of even number of 1's?
1
5
2
1
3
2
4
4