MCQOPTIONS
Saved Bookmarks
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. |
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. | |
| 2. |
Complement of a ^ nb ^ m where n >= 4 and m <= 3 is example of |
| A. | Type 0 |
| B. | Type 1 |
| C. | Type 2 |
| D. | Type 3 |
| Answer» E. | |
| 3. |
a ^ nb ^ n where (n+m) is even . |
| A. | Type 0 |
| B. | Type 1 |
| C. | Type 2 |
| D. | Type 3 |
| Answer» E. | |
| 4. |
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. | |
| 5. |
(a ^ 5b ^ 5)* is example of ________ |
| A. | Type 0 language |
| B. | Type 1 language |
| C. | Type 2 language |
| D. | Type 3 language |
| Answer» E. | |
| 6. |
Homomorphism of a regular set is _______ |
| A. | Universal set |
| B. | Null set |
| C. | Regular set |
| D. | Non regular set |
| Answer» D. Non regular set | |
| 7. |
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 | |