MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 5 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 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 | |
| 2. |
For S->0S1|e for ={0,1}*, which of the following is wrong for the language produced? |
| A. | Non regular language |
| B. | 0<sup>n</sup>1<sup>n</sup> | n>=0 |
| C. | 0<sup>n</sup>1<sup>n</sup> | n>=1 |
| D. | None of the mentioned |
| Answer» E. | |
| 3. |
Which of the expression is appropriate?For production p: a->b where a V and b _______ |
| A. | V |
| B. | S |
| C. | (V+ )* |
| D. | V+ |
| Answer» D. V+ | |
| 4. |
The Grammar can be defined as: G=(V, , p, S)In the given definition, what does S represents? |
| A. | Accepting State |
| B. | Starting Variable |
| C. | Sensitive Grammar |
| D. | None of these |
| Answer» C. Sensitive Grammar | |
| 5. |
Production Rule: aAb->agb belongs to which of the following category? |
| A. | Regular Language |
| B. | Context free Language |
| C. | Context Sensitive Language |
| D. | Recursively Ennumerable Language |
| Answer» D. Recursively Ennumerable Language | |