Which of the following conversion is not possible (algorithmically)? – McqOptions

MCQOPTIONS

1.	Which of the following conversion is not possible (algorithmically)?
A.	Regular grammar to CFG
B.	NDFA to DFA
C.	NDPDA to DPDA
D.	NDTM to DTM
Answer» D. NDTM to DTM

Discussion

No Comment Found

Related MCQs

THE_LANGUAGE_ACCEPTED_BY_A_PUSH_DOWN_AUTOMATA?$
Given_the_following_statements_:_(i)_Recursive_enumerable_sets_are_closed_under_complementation._(ii)_Recursive_sets_are_closed_under_complements._Which_is/are_the_correct_statements_?$
Grammars that can be translated to DFA?
Recursively enumerable languages are not closed under
Consider the grammar given below E? E+E | E*E | E-E | E/E | E^E | (E) | id Assume that + and ^ have the same but least precedence, * and / have the next higher precedence but the same precedence and finally ^ has the highest precedence. Assume + and ^ associate to the left like * and / and that ^ associates to the right. Choose the correct for the ordered pairs (^,^) , (-,-) , (+,+) , (*,*) in the operator precedence table constructed for the grammar
Which of the following conversion is not possible (algorithmically)?
If P & R are regular and also given that if PQ=R, then
Assume the statements S1 and S2 given as :