MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 5 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory Questions and Answers knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which among the following is true for the given statement? |
| A. | 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. |
| B. | No DPDA can accept L by empty stack |
| C. | DPDA can accept L by an empty stack |
| D. | L is regular |
| E. | None of the mentioned |
| Answer» B. No DPDA can accept L by empty stack | |
| 2. |
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 | |
| 3. |
A pushdown automata can be defined as: (Q, ∑, G, q0, z0, A, d) |
| A. | What does the symbol z0 represents? |
| B. | an element of G |
| C. | initial stack symbol |
| D. | top stack alphabet |
| E. | all of the mentioned |
| Answer» E. all of the mentioned | |
| 4. |
A push down automata can be represented as: |
| A. | PDA= ε-NFA +[stack]State true or false: |
| B. | true |
| C. | false |
| Answer» B. true | |
| 5. |
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 | |