MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 8 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: For every removed state, there is a regular expression produced. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 2. |
It is suitable to use ____________ method/methods to convert a DFA to regular expression. |
| A. | Transitive Closure properties |
| B. | Brzozowski method |
| C. | State elimination method |
| D. | All of the mentioned |
| Answer» E. | |
| 3. |
The behaviour of NFA can be simulated using DFA. |
| A. | always |
| B. | never |
| C. | sometimes |
| D. | none of the mentioned |
| Answer» B. never | |
| 4. |
State true or false:Statement: The state removal approach identifies patterns within the graph and removes state, building up regular expressions along each transition. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 5. |
Which of the following methods is suitable for conversion of DFA to RE? |
| A. | Brzozowski method |
| B. | Arden s method |
| C. | Walter s method |
| D. | All of the mentioned |
| Answer» B. Arden s method | |
| 6. |
Which of the following is not a step in elimination of states procedure? |
| A. | Unifying all the final states into one using e-transitions |
| B. | Unify single transitions to multi transitions that contains union of input |
| C. | Remove states until there is only starting and accepting states |
| D. | Get the resulting regular expression by direct calculation |
| Answer» C. Remove states until there is only starting and accepting states | |
| 7. |
If we have more than one accepting states or an accepting state with an outdegree, which of the following actions will be taken? |
| A. | addition of new state |
| B. | removal of a state |
| C. | make the newly added state as final |
| D. | more than one option is correct |
| Answer» E. | |
| 8. |
Which of the following is an utility of state elimination phenomenon? |
| A. | DFA to NFA |
| B. | NFA to DFA |
| C. | DFA to Regular Expression |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |