MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 13 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. |
There is a linear grammar that generates a context free grammar |
| A. | always |
| B. | never |
| C. | sometimes |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 2. |
A___________ is context free grammar with atmost one non terminal in the right handside of the production. |
| A. | linear grammar |
| B. | linear bounded grammar |
| C. | regular grammar |
| D. | none of the mentioned |
| Answer» B. linear bounded grammar | |
| 3. |
If L1 and L2 are context free languages, L1-L2 are context free: |
| A. | always |
| B. | sometimes |
| C. | never |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 4. |
Which of the following is incorrect?There exists algorithms to decide if: |
| A. | String w is in CFL L |
| B. | CFL L is empty |
| C. | CFL L is infinite |
| D. | All of the mentioned |
| Answer» E. | |
| 5. |
Given Grammar G1:S->aSbS->eGrammar G2:R->cRdR->eIf L(G)=L(G1) U L(G2), the number of productions the new starting variable would have: |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 1 |
| Answer» B. 3 | |
| 6. |
THERE_IS_A_LINEAR_GRAMMAR_THAT_GENERATES_A_CONTEXT_FREE_GRAMMAR?$ |
| A. | always |
| B. | never |
| C. | sometimes |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 7. |
A____________IS_CONTEXT_FREE_GRAMMAR_WITH_ATMOST_ONE_NON_TERMINAL_IN_THE_RIGHT_HANDSIDE_OF_THE_PRODUCTION.?$ |
| A. | linear grammar |
| B. | linear bounded grammar |
| C. | regular grammar |
| D. | none of the mentioned |
| Answer» B. linear bounded grammar | |
| 8. |
If L1 and L2 are context free languages, L1-L2 are context free? |
| A. | always |
| B. | sometimes |
| C. | never |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 9. |
Which of the following is/are CFL not closed under? |
| A. | Reverse |
| B. | Homomorphism |
| C. | Inverse Homomorphism |
| D. | All of the mentioned |
| Answer» E. | |
| 10. |
Using the pumping constant n, If there is a string in the language of length between _____ and ____ then the language is infite else not. |
| A. | n, 2n-1 |
| B. | 2n, n |
| C. | n+1, 3n+6 |
| D. | 0, n+1 |
| Answer» B. 2n, n | |
| 11. |
If the start symbol is one of those symbols which produce no terminal through any sequence, the CFL is said to be |
| A. | nullable |
| B. | empty |
| C. | eliminated |
| D. | none of the mentioned |
| Answer» C. eliminated | |
| 12. |
Context free languages are not closed under: |
| A. | Intersection |
| B. | Intersection with Regular Language |
| C. | Complement |
| D. | All of the mentioned |
| Answer» E. | |
| 13. |
The context free languages are closed under: |
| A. | Intersection |
| B. | Complement |
| C. | Kleene |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |