![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
Which statement is true? |
A. | The tape of turing machine is infinite. |
B. | The tape of turing machine is finite. |
C. | The tape of turing machine is infinite when the language is regular |
D. | The tape of turing machine is finite when the language is nonregular. |
Answer» A. The tape of turing machine is infinite. |
View all MCQs in
Theory of ComputationNo comments yet