MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 15 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. |
FINITE_AUTOMATA_REQUIRES_MINIMUM_________NUMBER_OF_STACKS.?$ |
| A. | 1 |
| B. | 0 |
| C. | 2 |
| D. | None of the mentioned |
| Answer» C. 2 | |
| 2. |
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 | |
| 3. |
Number_of_final_state_require_to_accept_Φ_in_minimal_finite_automata.$# |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | None of the mentioned |
| Answer» E. | |
| 4. |
FSM with output capability can be used to add two given integer in binary representation. This is |
| A. | True |
| B. | False |
| C. | May be true |
| D. | None of the mentioned |
| Answer» B. False | |
| 5. |
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> | |
| 6. |
The basic limitation of finite automata is that |
| A. | It can’t remember arbitrary large amount of information. |
| B. | It sometimes recognize grammar that are not regular. |
| C. | It sometimes fails to recognize regular grammar. |
| D. | All of the mentioned |
| Answer» B. It sometimes recognize grammar that are not regular. | |
| 7. |
How_many_DFA’s_exits_with_two_states_over_input_alphabet_{0,1}_?$ |
| A. | 16 |
| B. | 26 |
| C. | 32 |
| D. | 64 |
| Answer» E. | |
| 8. |
Language of finite automata is? |
| A. | Type 0 |
| B. | Type 1 |
| C. | Type 2 |
| D. | Type 3 |
| Answer» E. | |
| 9. |
Languages of a automata is |
| A. | If it is accepted by automata |
| B. | If it halts |
| C. | If automata touch final state in its life time |
| D. | All language are language of automata |
| Answer» B. If it halts | |
| 10. |
String X is accepted by finite automata if . |
| A. | δ*(q,x) E A |
| B. | δ(q,x) E A |
| C. | δ*(Q0,x) E A |
| D. | δ(Q0,x) E A |
| Answer» D. ‚âà√≠¬¨‚Ä¢(Q0,x) E A | |
| 11. |
δ*(q,ya) is equivalent to .$ |
| A. | δ((q,y),a) |
| B. | δ(δ*(q,y),a) |
| C. | δ(q,ya) |
| D. | independent from δ notation |
| Answer» C. ‚âà√≠¬¨‚Ä¢(q,ya) | |
| 12. |
Extended transition function is . |
| A. | Q * Σ* -> Q |
| B. | Q * Σ -> Q |
| C. | Q* * Σ* -> Σ |
| D. | Q * Σ -> Σ |
| Answer» B. Q * ‚âà√≠¬¨¬£ -> Q | |
| 13. |
Number of states require to accept string ends with 10. |
| A. | 3 |
| B. | 2 |
| C. | 1 |
| D. | can’t be represented. |
| Answer» B. 2 | |
| 14. |
Transition function maps. |
| A. | Σ * Q -> Σ |
| B. | Q * Q -> Σ |
| C. | Σ * Σ -> Q |
| D. | Q * Σ -> Q |
| Answer» E. | |
| 15. |
There are ________ tuples in finite state machine. |
| A. | 4 |
| B. | 5 |
| C. | 6 |
| D. | unlimited |
| Answer» C. 6 | |