MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 154 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory knowledge and support exam preparation. Choose a topic below to get started.
| 151. |
With reference of a DPDA, which among the following do we perform from the start state with an empty stack? |
| A. | process the whole string |
| B. | end in final state |
| C. | end with an empty stack |
| D. | all of the mentioned |
| Answer» E. | |
| 152. |
|-* is the __________ closure of |- |
| A. | symmetric and reflexive |
| B. | transitive and reflexive |
| C. | symmetric and transitive |
| D. | none of the mentioned |
| Answer» C. symmetric and transitive | |
| 153. |
A PDA machine configuration (p, w, y) can be correctly represented as: |
| A. | (current state, unprocessed input, stack content) |
| B. | (unprocessed input, stack content, current state) |
| C. | (current state, stack content, unprocessed input) |
| D. | none of the mentioned |
| Answer» B. (unprocessed input, stack content, current state) | |
| 154. |
The transition a Push down automaton makes is additionally dependent upon the: |
| A. | stack |
| B. | input tape |
| C. | terminals |
| D. | none of the mentioned |
| Answer» B. input tape | |