MCQOPTIONS
Saved Bookmarks
This section includes 1 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 number of final states we need as per the given language?Language L: {an| n is even or divisible by 3} |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |