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. |
Regular Expression denote precisely the ________ of Regular Language. |
| A. | Class |
| B. | Power Set |
| C. | Super Set |
| D. | None of the mentioned |
| Answer» B. Power Set | |
| 2. |
The minimum number of states required to automate the following Regular Expression:(1) *(01+10) (1) * |
| A. | 4 |
| B. | 3 |
| C. | 2 |
| D. | 5 |
| Answer» B. 3 | |
| 3. |
(0+ε) (1+ε) represents |
| A. | {0, 1, 01, ε} |
| B. | {0, 1, ε} |
| C. | {0, 1, 01 ,11, 00, 10, ε} |
| D. | {0, 1} |
| Answer» B. {0, 1, ε} | |
| 4. |
In order to represent a regular expression, the first step to create the transition diagram is: |
| A. | Create the NFA using Null moves |
| B. | Null moves are not acceptable, thus should not be used |
| C. | Predict the number of states to be used in order to construct the Regular expression |
| D. | None of the mentioned |
| Answer» B. Null moves are not acceptable, thus should not be used | |
| 5. |
Arden’s theorem is true for: |
| A. | More than one initial states |
| B. | Null transitions |
| C. | Non-null transitions |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 6. |
P, O, R be regular expression over ∑, P is not ε, thenR=Q + RP has a unique solution: |
| A. | Q*P |
| B. | QP* |
| C. | Q*P* |
| D. | (P*O*) *View Answer |
| Answer» C. Q*P* | |
| 7. |
Simplify the following regular expression:ε+1*(011) *(1*(011) *) * |
| A. | (1+011) * |
| B. | (1*(011) *) |
| C. | (1+(011) *) * |
| D. | (1011) * |
| Answer» B. (1*(011) *) | |
| 8. |
(0+‚ÂÀ√≠¬¨¬µ)_(1+‚ÂÀ√≠¬¨¬µ)_REPRESENTS?$# |
| A. | {0, 1, 01, ε} |
| B. | {0, 1, ε} |
| C. | {0, 1, 01 ,11, 00, 10, ε} |
| D. | {0, 1} |
| Answer» B. {0, 1, ‚âà√≠¬¨¬µ} | |
| 9. |
The_minimum_number_of_states_required_to_automate_the_following_Regular_Expression:$ |
| A. | *(01+10) (1) * |
| B. | 4 |
| C. | 3 |
| D. | 2 |
| Answer» B. 4 | |
| 10. |
The difference between number of states with regular expression (a + b) and (a + b) * is: |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 0 |
| Answer» B. 2 | |
| 11. |
Arden’s theorem is true for:$ |
| A. | More than one initial states |
| B. | Null transitions |
| C. | Non-null transitions |
| D. | None of the mentioned |
| Answer» B. Null transitions | |
| 12. |
Q*P |
| A. | QP* |
| B. | Q*P* |
| C. | (P*O*) * |
| Answer» D. | |
| 13. |
Simplify the following regular expression: |
| A. | *(1*(011) *) * |
| B. | (1+011) * |
| C. | (1*(011) *) |
| D. | (1+(011) *) * |
| Answer» B. (1+011) * | |
| 14. |
Which among the following are incorrect regular identities? |
| A. | εR=R |
| B. | ε*=ε |
| C. | Ф*=ε |
| D. | R–§=R |
| Answer» E. | |
| 15. |
A finite automaton accepts which type of language: |
| A. | Type 0 |
| B. | Type 1 |
| C. | Type 2 |
| D. | Type 3 |
| Answer» E. | |