MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
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. |
The language L ={ai2bi|i>=0} is: |
| A. | recursive |
| B. | deterministic CFL |
| C. | regular |
| D. | Two of the mentioned is correct |
| Answer» E. | |
| 2. |
Which of the following are context free language? |
| A. | L={a<sup>i</sup>b<sup>i</sup>|i>=0} |
| B. | L={ww<sup>r</sup>| w is a string and r represents reverse} |
| C. | All of the mentioned |
| D. | one of the mentioned |
| Answer» B. L={ww<sup>r</sup>| w is a string and r represents reverse} | |
| 3. |
Which of the following are non essential while simplifying a grammar? |
| A. | Removal of useless symbols |
| B. | Removal of unit productions |
| C. | Removal of null production |
| D. | None of the mentioned |
| Answer» E. | |
| 4. |
Statement 1: Ambiguity is the property of grammar but not the language.
|
| A. | nWhich of the following options are correct with respect to the given statements? |
| B. | Statement 1 is true but statement 2 is false |
| C. | Statement 1 is false but statement 2 is true |
| D. | Both the statements are true |
| E. | Both the statements are false |
| Answer» D. Both the statements are true | |
| 5. |
Which among the following is incorrect with reference to a derivation tree? |
| A. | Every vertex has a label which is a terminal or a variable. |
| B. | The root has a label which can be a terminal. |
| C. | The label of the internal vertex is a variable. |
| D. | None of the mentioned |
| Answer» C. The label of the internal vertex is a variable. | |
| 6. |
State true or false:
|
| A. | nStatement: No regular expression exists for the given grammar. |
| B. | true |
| C. | false |
| Answer» B. true | |
| 7. |
CFGs are more powerful than: |
| A. | DFA |
| B. | NDFA |
| C. | Mealy Machine |
| D. | All of the mentioned |
| Answer» E. | |