MCQ bookmark_border Q. Which of the following will not be accepted by the following DFA? A ababaabaa B abbbaa C abbbaa D abbaabbaa Correct Answer: A Check Answer report_problem Report
MCQ bookmark_border 1. Which of the following statement is false? A A recursive language is also a regular language B A context free language is also a regular language C A context free language is also recursive enumerable language D Both (a) and (b) Correct Answer: A Check Answer report_problem Report forum Discussion
MCQ bookmark_border 2. Push down automata accepts which language A Context sensitive language B Context free language C Recursive language D None of these Correct Answer: B Check Answer report_problem Report forum Discussion
MCQ bookmark_border 3. Let G be the CFG, l be the number of left most derivations, r be the number of right most derivations and P be the number of parse trees. Assume l , r and P are computed for a particular string. For a given CFG A l ? P ? r B l = P = r C l ? P ? r D none of these Correct Answer: B Check Answer report_problem Report forum Discussion
MCQ bookmark_border 4. Which of the following statement is false? A The context free language can be converted into Chomsky normal form B The context free language can be converted into Greibach normal form C The context free language is accepted by pushdown automata D None of these Correct Answer: D Check Answer report_problem Report forum Discussion
MCQ bookmark_border 5. Reverse of a DFA can be formed by---- A using PDA B making final state as non-final C making final as starting state and starting state as final state D None of the above Correct Answer: C making final as starting state and starting state as final state Check Answer report_problem Report forum Discussion
