MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 7 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. |
Number of states require to simulate a computer with memory capable of storing 3 words each of length 8 . |
| A. | 3 * 2<sup>8</sup> |
| B. | 2<sup>(3*8)</sup> |
| C. | 2<sup>(3+8)</sup> |
| D. | None of the mentioned |
| Answer» C. 2<sup>(3+8)</sup> | |
| 2. |
How many DFA s exits with two states over input alphabet {0,1} ? |
| A. | 16 |
| B. | 26 |
| C. | 32 |
| D. | 64 |
| Answer» E. | |
| 3. |
Regular expression for all strings starts with ab and ends with bba is. |
| A. | aba*b*bba |
| B. | ab(ab)*bba |
| C. | ab(a+b)*bba |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 4. |
Number of final state require to accept in minimal finite automata. |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | None of the mentioned |
| Answer» E. | |
| 5. |
Finite automata requires minimum _______ number of stacks. |
| A. | 1 |
| B. | 0 |
| C. | 2 |
| D. | None of the mentioned |
| Answer» C. 2 | |
| 6. |
Language of finite automata is. |
| A. | Type 0 |
| B. | Type 1 |
| C. | Type 2 |
| D. | Type 3 |
| Answer» E. | |
| 7. |
*(q,ya) is equivalent to . |
| A. | ((q,y),a) |
| B. | ( *(q,y),a) |
| C. | (q,ya) |
| D. | independent from notation |
| Answer» C. (q,ya) | |