MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 2 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following is true about Turing s a-machine? |
| A. | a stands for automatic |
| B. | left ended, right end-infinite |
| C. | finite number of tape symbols were allowed |
| D. | all of the mentioned |
| Answer» E. | |
| 2. |
A deterministic turing machine is: |
| A. | ambiguous turing machine |
| B. | unambiguous turing machine |
| C. | non-deterministic |
| D. | none of the mentioned |
| Answer» C. non-deterministic | |