MCQOPTIONS
Saved Bookmarks
This section includes 4 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. |
abb*c denotes which of the following? |
| A. | {abnc|n=0} |
| B. | {abnc|n=1} |
| C. | {anbc|n=0} |
| D. | {abcn|n>0} |
| Answer» C. {anbc|n=0} | |
| 2. |
Which of the following strings is not generated by the given grammar:S->SaSbS|e |
| A. | aabb |
| B. | abab |
| C. | abaabb |
| D. | None of the mentioned |
| Answer» E. | |
| 3. |
Which of the following strings do not belong the given regular expression?(a)*(a+cba) |
| A. | aa |
| B. | aaa |
| C. | acba |
| D. | acbacba |
| Answer» E. | |
| 4. |
Which of the following is analogous to the following?:NFA and NPDA |
| A. | Regular language and Context Free language |
| B. | Regular language and Context Sensitive language |
| C. | Context free language and Context Sensitive language |
| D. | None of the mentioned |
| Answer» B. Regular language and Context Sensitive language | |