MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 6 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. |
L_AND_~L_ARE_RECURSIVE_ENUMERABLE_THEN_L_IS?$ |
| A. | Regular |
| B. | Context free |
| C. | Context sensitive |
| D. | Recursive |
| Answer» E. | |
| 2. |
Regular_expressions_are_closed_under$ |
| A. | Union |
| B. | Intersection |
| C. | Kleen star |
| D. | All of the mentioned |
| Answer» E. | |
| 3. |
Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then |
| A. | L1<L2 |
| B. | L1>=L2 |
| C. | L1 U L2 = .* |
| D. | L1=L2 |
| Answer» E. | |
| 4. |
Regular grammar is |
| A. | context free grammar |
| B. | non context free grammar |
| C. | english grammar |
| D. | none of the mentioned |
| Answer» B. non context free grammar | |
| 5. |
A language is regular if and only if |
| A. | accepted by DFA |
| B. | accepted by PDA |
| C. | accepted by LBA |
| D. | accepted by Turing machine |
| Answer» B. accepted by PDA | |
| 6. |
How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*? |
| A. | 7 |
| B. | 10 |
| C. | 12 |
| D. | 11 |
| Answer» E. | |