MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 3 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory Questions and Answers knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
L={0i1j2k | j>i+k} |
| A. | Which of the following satisfies the language? |
| B. | 0111100 |
| C. | 011100 |
| D. | 0001100 |
| E. | 0101010 |
| Answer» B. 0111100 | |
| 2. |
Which among the following is the correct grammar for the given language? |
| A. | L={x∈{0,1}*|number of zeroes in x¹number of one’s in x} |
| B. | S-> 0|SS|1SS|SS1|S1S |
| C. | S-> 1|0S|0SS|SS0|S0S |
| D. | S-> 0|0S|1SS|SS1|S1S |
| E. | None of the mentioned |
| Answer» D. S-> 0|0S|1SS|SS1|S1S | |
| 3. |
Which among the following is a CFG for the given Language: |
| A. | L={x∈{0,1}*|number of zeroes in x=number of one’s in x} |
| B. | S->e|0S1|1S0|SS |
| C. | S->0B|1A|e A->0S B->1S |
| D. | All of the mentioned |
| E. | None of the mentioned |
| Answer» D. All of the mentioned | |