MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 18 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={0i1j2k | j>i+k}Which of the following satisfies the language? |
| A. | 0111100 |
| B. | 011100 |
| C. | 0001100 |
| D. | 0101010 |
| Answer» B. 011100 | |
| 2. |
Which among the following is the correct grammar for the given language?L={x∈{0,1}*|number of zeroes in x¹number of one’s in x} |
| A. | S-> 0|SS|1SS|SS1|S1S |
| B. | S-> 1|0S|0SS|SS0|S0S |
| C. | S-> 0|0S|1SS|SS1|S1S |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 3. |
Which of the following languages are most suitable for implement context free languages ? |
| A. | C |
| B. | Perl |
| C. | Assembly Language |
| D. | None of the mentioned |
| Answer» B. Perl | |
| 4. |
Which among the following is a CFG for the given Language:L={x∈{0,1}*|number of zeroes in x=number of one’s in x} |
| A. | S->e|0S1|1S0|SS |
| B. | S->0B|1A|e A->0S B->1S |
| C. | All of the mentioned |
| Answer» D. | |
| 5. |
A grammar G=(V, T, P, S) is __________ if every production taken one of the two forms:B->aCB->a |
| A. | Ambiguous |
| B. | Regular |
| C. | Non Regular |
| D. | None of the mentionedView Answer |
| Answer» C. Non Regular | |
| 6. |
For the given Regular expression, the minimum number of terminals required to derive its grammar is:(011+1)*(01)* |
| A. | 4 |
| B. | 3 |
| C. | 5 |
| D. | 6 |
| Answer» C. 5 | |
| 7. |
For the given Regular expression, the minimum number of variables including starting variable required to derive its grammar is:(011+1)*(01)* |
| A. | 4 |
| B. | 3 |
| C. | 5 |
| D. | 6 |
| Answer» D. 6 | |
| 8. |
What the does the given CFG defines?S->aSbS|bSaS|e and w denotes terminal |
| A. | wwr |
| B. | wSw |
| C. | Equal number of a’s and b’s |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 9. |
State true or false:Statement: Every right-linear grammar generates a regular language. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 10. |
WHICH_OF_THE_FOLLOWING_LANGUAGES_ARE_MOST_SUITABLE_FOR_IMPLEMENT_CONTEXT_FREE_LANGUAGES_??$ |
| A. | C |
| B. | Perl |
| C. | Assembly Language |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 11. |
Which_among_the_following_is_the_correct_grammar_for_the_given_language?$ |
| A. | |
| B. | S-> 0|SS|1SS|SS1|S1S |
| C. | S-> 1|0S|0SS|SS0|S0S |
| Answer» B. S-> 0|SS|1SS|SS1|S1S | |
| 12. |
Which among the following is a CFG for the given Language? |
| A. | |
| B. | S->e|0S1|1S0|SS |
| C. | S->0B|1A|e A->0S B->1S |
| Answer» B. S->e|0S1|1S0|SS | |
| 13. |
Ambiguous |
| A. | Regular |
| B. | Non Regular |
| C. | None of the mentioned |
| Answer» D. | |
| 14. |
For the given Regular expression, the minimum number of terminals required to derive its grammar is: |
| A. | *(01)* |
| B. | 4 |
| C. | 3 |
| D. | 5 |
| Answer» C. 3 | |
| 15. |
For the given Regular expression, the minimum number of variables including starting variable required to derive its grammar is: |
| A. | *(01)* |
| B. | 4 |
| C. | 3 |
| D. | 5 |
| Answer» D. 5 | |
| 16. |
If L1 and L2 are context free languages, which of the following is context free? |
| A. | L1* |
| B. | L2UL1 |
| C. | L1.L2 |
| D. | All of the mentioned |
| Answer» E. | |
| 17. |
What the does the given CFG defines? |
| A. | |
| B. | wwr |
| C. | wSw |
| Answer» D. | |
| 18. |
State true or false: |
| A. | |
| B. | True |
| Answer» B. True | |