MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 7 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 the closure property of a regular language? |
| A. | Emptiness |
| B. | Universality |
| C. | Membership |
| D. | None of the mentioned |
| Answer» E. | |
| 2. |
If L is a regular language, then (((L’)r)’)* is: |
| A. | regular |
| B. | non regular |
| C. | may be regular |
| D. | none of the mentioned |
| Answer» B. non regular | |
| 3. |
If L is a regular language, then (L’)’ U L will be : |
| A. | L |
| B. | L’ |
| C. | f |
| D. | none of the mentioned |
| Answer» B. L’ | |
| 4. |
Suppose a language L1 has 2 states and L2 has 2 states. After using the cross product construction method,we have a machine M that accepts L1 ∩ L2. The total number of states in M: |
| A. | 6 |
| B. | 4 |
| C. | 2 |
| D. | 8 |
| Answer» C. 2 | |
| 5. |
If A and B are regular languages, !(A’ U B’) is: |
| A. | regular |
| B. | non regular |
| C. | may be regular |
| D. | none of the mentioned |
| Answer» B. non regular | |
| 6. |
If L1 and L2′ are regular languages, L1 ∩ (L2′ U L1′)’ will be |
| A. | regular |
| B. | non regular |
| C. | may be regular |
| D. | none of the mentioned |
| Answer» B. non regular | |
| 7. |
If L1′ and L2′ are regular languages, then L1.L2 will be |
| A. | regular |
| B. | non regular |
| C. | may be regular |
| D. | none of the mentioned |
| Answer» B. non regular | |