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. |
HOMOMORPHISM_OF_A_REGULAR_SET_IS________?$ |
| A. | Universal set |
| B. | Null set |
| C. | Regular set |
| D. | Non regular set |
| Answer» D. Non regular set | |
| 2. |
Which of the following is type 3 language ?$ |
| A. | Strings of 0’s whose length is perfect square |
| B. | Palindromes string |
| C. | Strings of 0’s having length prime number |
| D. | String of odd number of 0’s |
| Answer» E. | |
| 3. |
(a_^_5b_^_5)*_is_example_of_________$ |
| A. | Type 0 language |
| B. | Type 1 language |
| C. | Type 2 language |
| D. | Type 3 language |
| Answer» E. | |
| 4. |
Complement of (a + b)* will be |
| A. | phi |
| B. | null |
| C. | a |
| D. | b |
| Answer» B. null | |
| 5. |
a ^ nb ^ m where n >= 1, m >= 1, nm >= 3 is example of |
| A. | Type 0 |
| B. | Type 1 |
| C. | Type 2 |
| D. | Type 3 |
| Answer» E. | |
| 6. |
Complement of a ^ nb ^ m where n >= 4 and m |
| A. | Type 0 |
| B. | Type 1 |
| C. | Type 2 |
| D. | Type 3 |
| Answer» E. | |
| 7. |
a_^_nb_^_n_where_(n+m)_is_even_. |
| A. | Type 0 |
| B. | Type 1 |
| C. | Type 2 |
| D. | Type 3 |
| Answer» E. | |
| 8. |
A ___________ is a substitution such that h(a) contains a string for each a? |
| A. | Closure |
| B. | Interchange |
| C. | Homomorphism |
| D. | Inverse Homomorphism |
| Answer» D. Inverse Homomorphism | |
| 9. |
Reverse of (0+1)* will be |
| A. | Phi |
| B. | Null |
| C. | (0+1)* |
| D. | (0+1) |
| Answer» D. (0+1) | |
| 10. |
Reverse of a DFA can be formed by |
| A. | using PDA |
| B. | making final state as non-final |
| C. | making final as starting state and starting state as final state |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 11. |
If L1 is regular L2 is unknown but L1-L2 is regular ,then L2 must be |
| A. | Empty set |
| B. | CFG |
| C. | Decidable |
| D. | Regular |
| Answer» E. | |
| 12. |
If L1 and L2 are regular sets then intersection of these two will be |
| A. | Regular |
| B. | Non Regular |
| C. | Recursive |
| D. | Non Recursive |
| Answer» B. Non Regular | |
| 13. |
Complement of regular sets are _________ |
| A. | Regular |
| B. | CFG |
| C. | CSG |
| D. | RE |
| Answer» B. CFG | |
| 14. |
Complement of a DFA can be obtained by |
| A. | making starting state as final state. |
| B. | no trival method. |
| C. | making final states non-final and non-final to final. |
| D. | make final as a starting state. |
| Answer» D. make final as a starting state. | |
| 15. |
Regular sets are closed under union,concatenation and kleene closure. |
| A. | True |
| B. | False |
| C. | Depends on regular set |
| D. | Can’t say |
| Answer» B. False | |