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. |
What is the pumping length of string of length x? |
| A. | x+1 |
| B. | x |
| C. | x-1 |
| D. | x2 |
| Answer» B. x | |
| 2. |
The pumping lemma is often used to prove that a language is: |
| A. | Context free |
| B. | Not context free |
| C. | Regular |
| D. | None of the mentioned |
| Answer» C. Regular | |
| 3. |
Which of the following cannot be filled in the blank below?Statement: There are CFLs L1 nad L2 so that ___________is not a CFL. |
| A. | L1 L2 |
| B. | L1 |
| C. | L1* |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 4. |
State true or false:Statement: We cannot use Ogden s lemma when pumping lemma fails. |
| A. | true |
| B. | false |
| Answer» C. | |
| 5. |
Using pumping lemma, which of the following cannot be proved as not a CFL ? |
| A. | {a<sup>i</sup>b<sup>i</sup>c<sup>i</sup>|i>=0} |
| B. | {ss|s {a,b}*} |
| C. | The set legal C programs |
| D. | None of the mentioned |
| Answer» E. | |
| 6. |
Which of the following is called Bar-Hillel lemma? |
| A. | Pumping lemma for regular language |
| B. | Pumping lemma for context free languages |
| C. | Pumping lemma for context sensitive languages |
| D. | None of the mentioned |
| Answer» C. Pumping lemma for context sensitive languages | |