MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 4 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. |
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), for some r ϵ R} |
| C. | Q’ = {q0} |
| D. | All of the mentioned |
| Answer» E. | |
| 3. |
Which among the following NFA’s is correct corresponding to the given Language? |
| A. | L= {xϵ {0, 1} | 3rd bit from right is 0} |
| B. | a) |
| C. | b) |
| D. | c) |
| E. | None of the mentioned |
| Answer» B. a) | |
| 4. |
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 | |