MCQ bookmark_border Q. Which of the following does the given Mealy machine represents? A 1 B 2 C 10 D 9 Correct Answer: A Check Answer report_problem Report
MCQ bookmark_border 1. Which of the following statement is correct? A All Regular grammar are context free but not vice versa B All context free grammar are regular grammar but not vice versa C Regular grammar and context free grammar are the same entity D None of the mentioned Correct Answer: A Regular grammar is a subset of context free grammar and thus all regular grammars are context free. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 2. The minimum state automaton equivalent to the below FSA has the following number of states--- A 1 B 2 C 3 D 4 Correct Answer: B Check Answer report_problem Report forum Discussion
MCQ bookmark_border 3. Which among the following cannot be accepted by a regular grammar? A L is a set of numbers divisible by 2 B L is a set of binary complement C L is a set of string with odd number of 0 D L is a set of 0n1n Correct Answer: D There exists no finite automata to accept the given language i.e. 0n1n. For other options, it is possible to make a dfa or nfa representing the language set. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 4. Which of the following language accepted by a Push down Automata? A Type0 B Type1 C Type2 D Type3 Correct Answer: C A known fact that type 2 grammar is accepted by PDA. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 5. 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
