If n is the length of Input string and m is the number of nodes, the r – McqOptions

MCQOPTIONS

1.	If n is the length of Input string and m is the number of nodes, the running time of DFA is x that of NFA.Find x?
A.	1/m<sup>2</sup>
B.	2<sup>m</sup>
C.	1/m
D.	log m
Answer» B. 2<sup>m</sup>

Discussion

No Comment Found

Related MCQs

If n is the length of Input string and m is the number of nodes, the running time of DFA is x that of NFA.Find x?
The construction time for DFA from an equivalent NFA (m number of node)is:
Given Language L= {x {a, b}*|x contains aba as its substring}Find the difference of transitions made in constructing a DFA and an equivalent NFA?
Which of the following is correct proposition?Statement 1: Non determinism is a generalization of Determinism.
NFA, in its name has non-deterministic because of :
Given Language: L= {ab U aba}*If X is the minimum number of states for a DFA and Y is the number of states to construct the NFA,
Which of the following options is correct?Statement 1: Initial State of NFA is Initial State of DFA.