MCQ bookmark_border Q. What is the complement of the language accepted by the NFA shown below? Assume ? = {a} and ? is the empty string. A ? B ? C a D {a, ?} Correct Answer: B The given alphabet ? contains only one symbol {a} and the given NFA accepts all strings with any number of occurrences of Check Answer report_problem Report
MCQ bookmark_border 1. Which of the following problems occur?i) Does a given program ever produce an output? ii) If L is a CFL, then is L A i, ii, iii, iv B i, ii C ii, iii, iv D iii, iv Correct Answer: D i) Is a variation of Turing Machine Halting problem and it is undecidable. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 2. What is the relation between NFA-accepted languages and DFA accepted languages? A > B < C < D <= Correct Answer: C The no of languages accepted by NFA and DFA is equal. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 3. Is empty string a valid input in Ndfa. A True B True C > Explanation : Empty strings can be inputted n a NDFA. D iv class="v-slide-group__next v-slide-group__next--disabled"> Explanation : Empty strings can be inputted n a NDFA. Correct Answer: A Empty strings can be inputted n a NDFA.
MCQ bookmark_border 4. Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. Complete the partially completed DFA that accepts this language is shown below.The missing arcs in the DFA are A B C D Correct Answer: D State Check Answer report_problem Report forum Discussion
MCQ bookmark_border 5. Find the wrong statement? A The language accepted by finite automata are the languages denoted by regular expression B Every DFA has a regular expression denoting its language C For a regular expression r, there does not exists NDFA with L D None of the mentioned Correct Answer: C The vice versa is true. Check Answer report_problem Report forum Discussion
_1630842500.png)
_1630842645.png)