MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 14 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 total number of states to build the given language using DFA:L= {w | w has exactly 2 a’s and at least 2 b’s} |
| A. | 10 |
| B. | 11 |
| C. | 12 |
| D. | 13 |
| Answer» B. 11 | |
| 2. |
Predict the number of transitions required to automate the following language using only 3 states:L= {w | w ends with 00} |
| A. | 3 |
| B. | 2 |
| C. | 4 |
| D. | Cannot be said |
| Answer» B. 2 | |
| 3. |
L1= {w | w does not contain the string tr }L2= {w | w does contain the string tr}Given ∑= {t, r}, The difference of the minimum number of states required to form L1 and L2? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | Cannot be said |
| Answer» B. 1 | |
| 4. |
John is asked to make an automaton which accepts a given string for all the occurrence of ‘1001’ in it. How many number of transitions would John use such that, the string processing application works? |
| A. | 9 |
| B. | 11 |
| C. | 12 |
| D. | 15 |
| Answer» B. 11 | |
| 5. |
PREDICT_THE_NUMBER_OF_TRANSITIONS_REQUIRED_TO_AUTOMATE_THE_FOLLOWING_LANGUAGE_USING_ONLY_3_STATES:?$ |
| A. | |
| B. | 3 |
| C. | 2 |
| Answer» B. 3 | |
| 6. |
The_total_number_of_states_to_build_the_given_language_using_DFA:$ |
| A. | |
| B. | 10 |
| C. | 11 |
| Answer» B. 10 | |
| 7. |
L1= {w | w does not contain the string tr ? |
| A. | |
| B. | |
| Answer» B. | |
| 8. |
Which among the following is not an application of FSM? |
| A. | Lexical Analyser |
| B. | BOT |
| C. | State charts |
| D. | None of the mentioned |
| Answer» E. | |
| 9. |
Which among the following can be an example of application of finite state machine(FSM)? |
| A. | Communication Link |
| B. | Adder |
| C. | Stack |
| D. | None of the mentioned |
| Answer» B. Adder | |
| 10. |
Which of the following do we use to form an NFA from a regular expression? |
| A. | Subset Construction Method |
| B. | Power Set Construction Method |
| C. | Thompson Construction Method |
| D. | Scott Construction Method |
| Answer» D. Scott Construction Method | |
| 11. |
John is asked to make an automaton which accepts a given string for all the occurrence of ‘1001’ in it. How many number of transitions would John use such that, the string processing application works?$ |
| A. | 9 |
| B. | 11 |
| C. | 12 |
| D. | 15 |
| Answer» B. 11 | |
| 12. |
Which of the following is an application of Finite Automaton? |
| A. | Compiler Design |
| B. | Grammar Parsers |
| C. | Text Search |
| D. | All of the mentioned |
| Answer» E. | |
| 13. |
It is less complex to prove the closure properties over regular languages using |
| A. | NFA |
| B. | DFA |
| C. | PDA |
| D. | Can’t be said |
| Answer» B. DFA | |
| 14. |
Under which of the following operation, NFA is not closed? |
| A. | Negation |
| B. | Kleene |
| C. | Concatenation |
| D. | None of the mentioned |
| Answer» E. | |