MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 13 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. |
Complete the following statement:Statement : A language is turing recognizable if an only if ___________a) an enumerator enumerates itb) it is finitec) both ( |
| A. | an enumerator enumerates itb) it is finitec) both (a) and ( |
| B. | it is finite |
| C. | both (a) and (b) |
| D. | none of the mentioned |
| Answer» B. it is finite | |
| 2. |
For the following language, an enumerator will print:L={anbn|n>=0} |
| A. | anbn |
| B. | {ab, a2b2, a3b3, …} |
| C. | {e, ab, a2b2, a3b3, …} |
| D. | None of the mentioned |
| Answer» C. {e, ab, a2b2, a3b3, …} | |
| 3. |
Enumerator is a turing machine with __________ |
| A. | an output printer |
| B. | 5 input tapes |
| C. | a stack |
| D. | none of the mentioned |
| Answer» B. 5 input tapes | |
| 4. |
State true or false:Statement: Turing Machine can change symbols on its tape, whereas the FA cannot change symbols on tape. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 5. |
X is a simple mathematical model of a computer. X has unrestricted and unlimited memory. X is a FA with R/W head. X can have an infinite tape divided into cells, each cell holding one symbol.Name X? |
| A. | Push Down Automata |
| B. | Non deterministic Finite Automata |
| C. | Turing machines |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 6. |
FOR_THE_FOLLOWING_LANGUAGE,_AN_ENUMERATOR_WILL_PRINT:?$ |
| A. | |
| B. | a<sup>n</sup>b<sup>n</sup> |
| C. | {ab, a<sup>2</sup>b<sup>2</sup>, a<sup>3</sup>b<sup>3</sup>, …} |
| Answer» C. {ab, a<sup>2</sup>b<sup>2</sup>, a<sup>3</sup>b<sup>3</sup>, ‚Äö√Ñ√∂‚àö√묨‚àÇ} | |
| 7. |
Complete the following statement:$ |
| A. | |
| B. | an enumerator enumerates it |
| C. | it is finite |
| Answer» B. an enumerator enumerates it | |
| 8. |
Enumerator is a turing machine with _________? |
| A. | an output printer |
| B. | 5 input tapes |
| C. | a stack |
| D. | none of the mentioned |
| Answer» B. 5 input tapes | |
| 9. |
Can a turing machine act like a transducer? |
| A. | yes |
| B. | no |
| Answer» B. no | |
| 10. |
Which among the following is not true for 2-way infinte TM? |
| A. | tape in both directions |
| B. | Leftmost square not distinguished |
| C. | Any computation that can be performed by 2-way infinite tape can also be performed by standard TM. |
| D. | None of the mentioned |
| Answer» E. | |
| 11. |
Which of the following cannot be a possibility of a TM while it processes an input? |
| A. | Enters accepting state |
| B. | Enters non-accepting state |
| C. | Enters infinite loop and never halts |
| D. | None of the mentioned |
| Answer» E. | |
| 12. |
Which of the following is/are not an application of turing machine? |
| A. | Language Recognization |
| B. | Computers of functions on non negative numbers |
| C. | Generating devices |
| D. | None of the mentioned |
| Answer» E. | |
| 13. |
X is a simple mathematical model of a computer. X has unrestricted and unlimited memory. X is a FA with R/W head. X can have an infinite tape divided into cells, each cell holding one symbol. |
| A. | |
| B. | Push Down Automata |
| C. | Non deterministic Finite Automata |
| Answer» D. | |