If T is a TM recognizing L, and T reads every symbol in the input string, τT(n) ≥ 2n + 2, then any language that can be accepted by a TM T with τT(n) = 2n + 2 is
A. | regular |
B. | not regular |
C. | uncertain |
D. | none of these |
Answer : C Explanation : |
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |