MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 12 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. |
A push down automata is said to be _________ if it has atmost one transition around all configurations. |
| A. | Finite |
| B. | Non regular |
| C. | Non-deterministic |
| D. | Deterministic |
| Answer» E. | |
| 2. |
Which of the following are the actions that operates on stack top? |
| A. | Pushing |
| B. | Popping |
| C. | Replacing |
| D. | All of the mentioned |
| Answer» E. | |
| 3. |
State true or false:Statement: Every context free grammar can be transformed into an equvalent non deterministic push down automata. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 4. |
A push down automata can represented using: |
| A. | Transition graph |
| B. | Transition table |
| C. | ID |
| D. | All of the mentioned |
| Answer» E. | |
| 5. |
Which of the following correctly resembles the given state diagram?a) {wwr|w=(a+b)*}b) ε is called the initial stack symbolc) Both ( |
| A. | {wwr|w=(a+b)*}b) ε is called the initial stack symbolc) Both (a) and ( |
| B. | *}b) ε is called the initial stack symbol |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» B. *}b) ε is called the initial stack symbol | |
| 6. |
Which of the following option resembles the given PDA? |
| A. | {0n1n|n>=0} |
| B. | {0n12n|n>=0} |
| C. | {02n1n|n>=0} |
| D. | None of the mentioned |
| Answer» B. {0n12n|n>=0} | |
| 7. |
WHICH_OF_THE_FOLLOWING_ARE_THE_ACTIONS_THAT_OPERATES_ON_STACK_TOP??$ |
| A. | Pushing |
| B. | Popping |
| C. | Replacing |
| D. | All of the mentioned |
| Answer» E. | |
| 8. |
A_push_down_automata_is_said_to_be___________if_it_has_atmost_one_transition_around_all_configurations.$ |
| A. | Finite |
| B. | Non regular |
| C. | Non-deterministic |
| D. | Deterministic |
| Answer» E. | |
| 9. |
A push down automata can represented using: |
| A. | Transition graph |
| B. | Transition table |
| C. | ID |
| D. | All of the mentioned |
| Answer» E. | |
| 10. |
Which of the following assertion is false? |
| A. | If L is a language accepted by PDA1 by final state, there exist a PDA2 that accepts L by empty stack i.e. L=L(PDA1)=L(PDA2) |
| B. | If L is a CFL then there exists a push down automata P accepting CF; ; by empty stack i.e. L=M(P) |
| C. | Let L is a language accepted by PDA1 then there exist a CFG X such that L(X)=M(P) |
| D. | All of the mentioned |
| Answer» E. | |
| 11. |
The moves in the PDA is technically termed as: |
| A. | Turnstile |
| B. | Shifter |
| C. | Router |
| D. | None of the mentioned |
| Answer» B. Shifter | |
| 12. |
The instantaneous PDA is has the following elements |
| A. | State |
| B. | Unconsumed input |
| C. | Stack content |
| D. | All of the mentioned |
| Answer» E. | |