MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 5 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. |
Which of the following is not an example of finite state machine system? |
| A. | Control Mechanism of an elevator |
| B. | Combinational Locks |
| C. | Traffic Lights |
| D. | Digital Watches |
| Answer» E. | |
| 2. |
Which of the following will the given DFA won’t accept? |
| A. | ε |
| B. | 11010 |
| C. | 10001010 |
| D. | String of letter count 11 |
| Answer» B. 11010 | |
| 3. |
Which of the following will not be accepted by the following DFA? |
| A. | ababaabaa |
| B. | abbbaa |
| C. | abbbaabb |
| D. | abbaabbaa |
| Answer» B. abbbaa | |
| 4. |
What does the following figure most correctly represents? |
| A. | Final state with loop x |
| B. | Transitional state with loop x |
| C. | Initial state as well as final state with loop x |
| D. | Insufficient Data |
| Answer» D. Insufficient Data | |
| 5. |
What the following DFA accepts? |
| A. | x is a string such that it ends with ‘101’ |
| B. | x is a string such that it ends with ‘01’ |
| C. | x is a string such that it has odd 1’s and even 0’s |
| D. | x is a strings such that it has starting and ending character as 1 |
| Answer» B. x is a string such that it ends with ‘01’ | |