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. |
For a basic turing machine, there exists an equivalent : |
| A. | 2-counter machine |
| B. | 3-counter machine |
| C. | 4-counter machine |
| D. | All of the mentioned |
| Answer» E. | |
| 2. |
A two-way infinite tape turing machine is ________ superior than the basic model of the turing machine in terms of power. |
| A. | more |
| B. | less |
| C. | no way |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 3. |
Which among the following options are correct?Statement 1: TMs can accept languages that are not accepted by any PDA with one stack.Statement 2: But PDA with two stacks can accept any language that a TM can accept. |
| A. | Statement 1 and 2, both are correct |
| B. | Statement 1 is correct but Statement 2 is false |
| C. | Statement 2 is correct while Statement 1 is false |
| D. | Statement 1 and 2, both are false |
| Answer» B. Statement 1 is correct but Statement 2 is false | |
| 4. |
State true or false:Statement: Using a two track tape, we can use a semi infinite tape to simulate an infinte tape. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 5. |
A_TWO-WAY_INFINITE_TAPE_TURING_MACHINE_IS__________SUPERIOR_THAN_THE_BASIC_MODEL_OF_THE_TURING_MACHINE_IN_TERMS_OF_POWER.?$ |
| A. | more |
| B. | less |
| C. | no way |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 6. |
For_a_basic_turing_machine,_there_exists_an_equivalent_:$ |
| A. | 2-counter machine |
| B. | 3-counter machine |
| C. | 4-counter machine |
| D. | All of the mentioned |
| Answer» E. | |
| 7. |
Which among the following options are correct? |
| A. | |
| B. | |
| Answer» B. | |
| 8. |
Which of the following is true with reference to semi-infinite tape using a two track tape? |
| A. | Can simulate a two way tape |
| B. | Upper track represents the head-right cells |
| C. | Lower track represents the head-left cells |
| D. | All of the mentioned |
| Answer» E. | |
| 9. |
Linear Bounded Automaton is a: |
| A. | Finite Automaton |
| B. | Turing Machine |
| C. | Push down Automaton |
| D. | None of the mentioned |
| Answer» C. Push down Automaton | |
| 10. |
Which of the following parameters cannot be used to restrict a turing machine? |
| A. | tape alphabets |
| B. | number of tapes |
| C. | number of states |
| D. | none of these |
| Answer» E. | |
| 11. |
Instantaneous description of a counter machine can be described using: |
| A. | the input tape contents |
| B. | position of the input head |
| C. | distance of storage heads from symbol Z |
| D. | all of the mentioned |
| Answer» E. | |
| 12. |
A ___________ is a multi tape turing machine whose input tape is read only. |
| A. | Counter Machine |
| B. | Multi-stack |
| C. | Alternating Turing machine |
| D. | None of the mentioned |
| Answer» B. Multi-stack | |
| 13. |
Can a single tape turing machine be simulated using deterministic 2-stack turing machine? |
| A. | Yes |
| B. | No |
| C. | Cannot be said |
| D. | none of the mentioned |
| Answer» B. No | |