MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 9 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. |
State true or false:Statement: Counter Automaton can exist for the language L={0i1i|i>=0} |
| A. | true |
| B. | false |
| Answer» B. false | |
| 2. |
For a counter automaton, with the symbols A and Z0, the string on the stack is always in the form of __________ |
| A. | A |
| B. | A<sup>n</sup>Z0, n>=0 |
| C. | Z0A<sup>n</sup>, n>=0 |
| D. | None of the mentioned |
| Answer» C. Z0A<sup>n</sup>, n>=0 | |
| 3. |
Which of the following can be accepted by a DPDA? |
| A. | The set of even length palindrome over {a,b} |
| B. | The set of odd length palindrome over {a,b} |
| C. | {xx<sup>c</sup>| where c stands for the complement,{0,1}} |
| D. | None of the mentioned |
| Answer» E. | |
| 4. |
Which among the following is true for the given statement?Statement :If there are strings R and T in a language L so that R is prefix of T and R is not equivalent to T. |
| A. | No DPDA can accept L by empty stack |
| B. | DPDA can accept L by an empty stack |
| C. | L is regular |
| D. | None of the mentioned |
| Answer» B. DPDA can accept L by an empty stack | |
| 5. |
Which of the following correctly recognize the symbol |- in context to PDA? |
| A. | Moves |
| B. | transition function |
| C. | or/not symbol |
| D. | none of the mentioned |
| Answer» B. transition function | |
| 6. |
A pushdown automata can be defined as: (Q, , G, q0, z0, A, d)What does the symbol z0 represents? |
| A. | an element of G |
| B. | initial stack symbol |
| C. | top stack alphabet |
| D. | all of the mentioned |
| Answer» E. | |
| 7. |
A push down automata can be represented as:PDA= -NFA +[stack]State true or false: |
| A. | true |
| B. | false |
| Answer» B. false | |
| 8. |
Halting states are of two types. They are: |
| A. | Accept and Reject |
| B. | Reject and Allow |
| C. | Start and Reject |
| D. | None of the mentioned |
| Answer» B. Reject and Allow | |
| 9. |
The production of the form A->B , where A and B are non terminals is called |
| A. | Null production |
| B. | Unit production |
| C. | Greibach Normal Form |
| D. | Chomsky Normal Form |
| Answer» C. Greibach Normal Form | |