MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 11 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. |
State true or false:Statement: If an n-state DFA accepts a string w of length n or more, then there must be a state that appears twice on the path labeled w from the start state to the final state. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 2. |
If a DFA has n states and the language contains any string of length n or more, the language is termed as: |
| A. | Infinite |
| B. | Empty |
| C. | Non regular |
| D. | None of the mentioned |
| Answer» E. | |
| 3. |
Suppose there is a string w=abbab, and there exists a DFA which accepts w. How many stepts will be required to test its membership? |
| A. | 2 |
| B. | 1 |
| C. | 4 |
| D. | None of the mentioned |
| Answer» E. | |
| 4. |
Which of the following is a function of Closure properties?a) Helps construct representationsb) Helps show informally described languages not to be in classc) Both ( |
| A. | Helps construct representationsb) Helps show informally described languages not to be in classc) Both (a) and ( |
| B. | Helps show informally described languages not to be in class |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
For an automata, which of the following are equivalent variants?DFA,NFA and NFA with epsilon transitions |
| A. | DFA and NFA |
| B. | NFA and epsilon NFA |
| C. | DFA and epsilon NFA |
| D. | All of the mentioned |
| Answer» E. | |
| 6. |
Which of the following is a function of Closure properties? |
| A. | Helps construct representations |
| B. | Helps show informally described languages not to be in class |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 7. |
Which of the following problems do not belong to decision properties? |
| A. | Given two languages, are there strings that are in both |
| B. | Is the language a subset of another regular language |
| C. | Is the language same as another regular language |
| D. | None of the mentioned |
| Answer» E. | |
| 8. |
Which of the following are not meant to specify a regular language? |
| A. | Regular Expression |
| B. | DFA |
| C. | NDFA and epsilon-NFA |
| D. | All of the mentioned |
| Answer» E. | |
| 9. |
Pick the odd one out of the given properties of a regular language: |
| A. | Kleene |
| B. | Reversal |
| C. | Homomorphism |
| D. | Membership |
| Answer» E. | |
| 10. |
Which of the following are decision properties? |
| A. | Emptiness |
| B. | Infiniteness |
| C. | Membership |
| D. | All of the mentioned |
| Answer» E. | |
| 11. |
Language classes have the following property: |
| A. | Closure property |
| B. | Decision property |
| C. | Closure & Decision property |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |