MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 7 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: Both NFA and e-NFA recognize exactly the same languages. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 2. |
An e-NFA is ___________ in representation. |
| A. | Quadruple |
| B. | Quintuple |
| C. | Triple |
| D. | None of the mentioned |
| Answer» C. Triple | |
| 3. |
The e-NFA recognizable languages are not closed under : |
| A. | Union |
| B. | Negation |
| C. | Kleene Closure |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 4. |
Is the language preserved in all the steps while eliminating epsilon transitions from a NFA? |
| A. | yes |
| B. | no |
| Answer» B. no | |
| 5. |
The __________ of a set of states, P, of an NFA is defined as the set of states reachable from any state in P following e-transitions. |
| A. | e-closure |
| B. | e-pack |
| C. | Q in the tuple |
| D. | None of the mentioned |
| Answer» B. e-pack | |
| 6. |
e-transitions are |
| A. | conditional |
| B. | unconditional |
| C. | input dependent |
| D. | none of the mentioned |
| Answer» C. input dependent | |
| 7. |
The automaton which allows transformation to a new state without consuming any input symbols: |
| A. | NFA |
| B. | DFA |
| C. | NFA-l |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |