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. |
There exists an initial state, 17 transition states, 7 final states and one dumping state, Predict the maximum number of states in its equivalent DFA? |
| A. | 226 |
| B. | 224 |
| C. | 225 |
| D. | 223 |
| Answer» B. 224 | |
| 2. |
Let N (Q, ∑, δ, q0, A) be the NFA recognizing a language L. Then for a DFA (Q’, ∑, δ’, q0’, A’), which among the following is true?a) Q’ = P(Q)b) Δ’ = δ’ (R, a) = {q ϵ Q | q ϵ δ (r, |
| A. | be the NFA recognizing a language L. Then for a DFA (Q’, ∑, δ’, q0’, A’), which among the following is true?a) Q’ = P(Q) |
| B. | Δ’ = δ’ (R, a) = {q ϵ Q | q ϵ δ (r, a), for some r ϵ R} |
| C. | Q’={q0} |
| D. | All of the mentioned |
| Answer» E. | |
| 3. |
Which of the following options is correct for the given statement?Statement: If K is the number of states in NFA, the DFA simulating the same language would have states less than 2k. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 4. |
Statement 1: NFA computes the string along parallel paths.Statement 2: An input can be accepted at more than one place in an NFA.Which among the following options are most appropriate? |
| A. | Statement 1 is true while 2 is not |
| B. | Statement 1 is false while is not |
| C. | Statement 1 and 2, both are true |
| D. | Statement 1 and 2, both are false |
| Answer» D. Statement 1 and 2, both are false | |
| 5. |
Predict the analogous operation for the given language:A: {[p, q] | p ϵ A1, q does not belong to A2} |
| A. | A1-A2 |
| B. | A2-A1 |
| C. | A1.A2 |
| D. | A1+A2 |
| Answer» B. A2-A1 | |
| 6. |
Let L be a language whose FA consist of 5 acceptance states and 11 non final states. It further consists of a dumping state. Predict the number of acceptance states in Lc. |
| A. | 16 |
| B. | 11 |
| C. | 5 |
| D. | 6 |
| Answer» B. 11 | |
| 7. |
Given Language: {x | it is divisible by 3}The total number of final states to be assumed in order to pass the number constituting {0, 1} is |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 3 |
| Answer» D. 3 | |
| 8. |
LET_N_(Q,_‚ÄÖ√Ñ√∂‚ÀւĆ‚ÀÖ¬¥,_‚ÂÀ√≠¬¨‚Ä¢,_Q0,_A)_BE_THE_NFA_RECOGNIZING_A_LANGUAGE_L._THEN_FOR_A_DFA_(Q‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬•,_‚ÄÖ√Ñ√∂‚ÀւĆ‚ÀÖ¬¥,_‚ÂÀ√≠¬¨‚Ä¢‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬•,_Q0‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬•,_A‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬•),_WHICH_AMONG_THE_FOLLOWING_IS_TRUE??$# |
| A. | Q’ = P(Q) |
| B. | Δ’ = δ’ (R, a) = {q ϵ Q | q ϵ δ (r, a), for some r ϵ R} |
| C. | Q’={q0} |
| D. | All of the mentioned |
| Answer» E. | |
| 9. |
There_exists_an_initial_state,_17_transition_states,_7_final_states_and_one_dumping_state,_Predict_the_maximum_number_of_states_in_its_equivalent_DFA?$ |
| A. | 226 |
| B. | 224 |
| C. | 225 |
| D. | 223 |
| Answer» B. 224 | |
| 10. |
Which of the following options is correct for the given statement? |
| A. | |
| B. | True |
| Answer» B. True | |
| 11. |
Predict the analogous operation for the given language: |
| A. | |
| B. | A1-A2 |
| C. | A2-A1 |
| Answer» B. A1-A2 | |
| 12. |
If L1 and L2 are regular languages, which among the following is an exception? |
| A. | L1 U L2 |
| B. | L1 – L2 |
| C. | L1 ‚à© L2 |
| D. | All of the mentioned |
| Answer» E. | |
| 13. |
Let L be a language whose FA consist of 5 acceptance states and 11 non final states. It further consists of a dumping state. Predict the number of acceptance states in Lc. |
| A. | 16 |
| B. | 11 |
| C. | 5 |
| D. | 6 |
| Answer» B. 11 | |
| 14. |
A binary string is divisible by 4 if and only if it ends with: |
| A. | 100 |
| B. | 1000 |
| C. | 1100 |
| D. | 0011 |
| Answer» B. 1000 | |
| 15. |
Given Language: {x | it is divisible by 3} |
| A. | |
| B. | 0 |
| C. | 1 |
| Answer» D. | |