MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 4 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. |
Finite state machine are not able to recognize Palindromes because: |
| A. | Finite automata cannot deterministically find the midpoint |
| B. | Finite automata cannot remember arbitarily large amount of data |
| C. | Even if the mid point is known, it cannot find whether the second half matches the first |
| D. | All of the mentioned |
| Answer» E. | |
| 2. |
Myphill Nerode does the following: |
| A. | Minimization of DFA |
| B. | Tells us exactly when a language is regular |
| C. | Minimization of DFA and tells us exactly when a language is regular |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 3. |
Which of the following options is incorrect? |
| A. | A language L is regular if and only if ~L has finite number of equivalent classes |
| B. | Let L be a regular language. If ~L has k equivalent classes, then any DFA that recognizes L must have atmost k states |
| C. | A language L is NFA-regular if and only if it is DFA-regular |
| D. | None of the mentioned |
| Answer» C. A language L is NFA-regular if and only if it is DFA-regular | |
| 4. |
If L is DFA-regular, L’ is |
| A. | Non regular |
| B. | DFA-regular |
| C. | Non-finite |
| D. | None of the mentioned |
| Answer» C. Non-finite | |