MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 5 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. |
Are ambiguous grammar context free? |
| A. | Yes |
| B. | No |
| Answer» B. No | |
| 2. |
The minimum number of productions required to produce a language consisting of palindrome strings over ∑={a,b} is |
| A. | 3 |
| B. | 7 |
| C. | 5 |
| D. | 6 |
| Answer» D. 6 | |
| 3. |
For S->0S1|e for ∑={0,1}*, which of the following is wrong for the language produced? |
| A. | Non regular language |
| B. | 0n1n | n>=0 |
| C. | 0n1n | n>=1 |
| D. | None of the mentioned |
| Answer» E. | |
| 4. |
Which among the following cannot be accepted by a regular grammar? |
| A. | L is a set of numbers divisible by 2 |
| B. | L is a set of binary complement |
| C. | L is a set of string with odd number of 0 |
| D. | L is a set of 0n1n |
| Answer» E. | |
| 5. |
The Grammar can be defined as: G=(V, ∑, p, S) |
| A. | In the given definition, what does S represents? |
| B. | Accepting State |
| C. | Starting Variable |
| D. | Sensitive Grammar |
| E. | None of these |
| Answer» C. Starting Variable | |