MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 15 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. |
Which of the following recognizes the same formal language as of DFA and NFA? |
| A. | Power set Construction |
| B. | Subset Construction |
| C. | Robin-Scott Construction |
| D. | All of the mentioned |
| Answer» E. | |
| 2. |
Which of the following is a regular language? |
| A. | String whose length is a sequence of prime numbers |
| B. | String with substring wwr in between |
| C. | Palindrome string |
| D. | String with even number of Zero’s |
| Answer» E. | |
| 3. |
The production of form non-terminal -> ε is called: |
| A. | Sigma Production |
| B. | Null Production |
| C. | Epsilon Production |
| D. | All of the mentioned |
| Answer» C. Epsilon Production | |
| 4. |
If L is a regular language, Lc and Lr both will be: |
| A. | Accepted by NFA |
| B. | Rejected by NFA |
| C. | One of them will be accepted |
| D. | Cannot be said |
| Answer» B. Rejected by NFA | |
| 5. |
The number of transitions required to convert the following into equivalents DFA: |
| A. | 2 |
| B. | 3 |
| C. | 1 |
| D. | 0 |
| Answer» B. 3 | |
| 6. |
Which of the following does the given NFA represent? |
| A. | {11, 101} * {01} |
| B. | {110, 01} * {11} |
| C. | {11, 110} * {0} |
| D. | {00, 110} * {1} |
| Answer» D. {00, 110} * {1} | |
| 7. |
Given Language:Ln= {xϵ {0,1} * | |x|≥n, nth symbol from the right in x is 1}How many state are required to execute L3 using NFA? |
| A. | 16 |
| B. | 15 |
| C. | 8 |
| D. | 7 |
| Answer» C. 8 | |
| 8. |
WHICH_OF_THE_FOLLOWING_IS_A_REGULAR_LANGUAGE??$ |
| A. | String whose length is a sequence of prime numbers |
| B. | String with substring ww<sup>r</sup> in between |
| C. | Palindrome string |
| D. | String with even number of Zero’s |
| Answer» E. | |
| 9. |
Which_of_the_following_recognizes_the_same_formal_language_as_of_DFA_and_NFA?$ |
| A. | Power set Construction |
| B. | Subset Construction |
| C. | Robin-Scott Construction |
| D. | All of the mentioned |
| Answer» E. | |
| 10. |
The production of form non-terminal -> ε is called?# |
| A. | Sigma Production |
| B. | Null Production |
| C. | Epsilon Production |
| D. | All of the mentioned |
| Answer» C. Epsilon Production | |
| 11. |
We can represent one language in more one FSMs, true or false? |
| A. | TRUE |
| B. | FALSE |
| C. | May be true |
| D. | Cannot be said |
| Answer» B. FALSE | |
| 12. |
In NFA, this very state is like dead-end non final state: |
| A. | ACCEPT |
| B. | REJECT |
| C. | DISTINCT |
| D. | START |
| Answer» C. DISTINCT | |
| 13. |
If L is a regular language, Lc and Lr both will be: |
| A. | Accepted by NFA |
| B. | Rejected by NFA |
| C. | One of them will be accepted |
| D. | Cannot be said |
| Answer» B. Rejected by NFA | |
| 14. |
Given Language: |
| A. | |
| B. | |
| Answer» C. | |
| 15. |
Subset Construction method refers to: |
| A. | Conversion of NFA to DFA |
| B. | DFA minimization |
| C. | Eliminating Null references |
| D. | ε-NFA to NFA |
| Answer» B. DFA minimization | |