Given Language: L= {ab U aba}*If X is the minimum number of states for – McqOptions

MCQOPTIONS

1.	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,
A.	n\|X-Y\|=?
B.	2
C.	3
D.	4
E.	1
Answer» B. 2

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}<br>Find the difference of transitions made in constructing a DFA and an equivalent NFA?
Which of the following is correct proposition?<br>Statement 1: Non determinism is a generalization of Determinism.
NFA, in its name has non-deterministic because of :
Given Language: L= {ab U aba}*<br>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?<br>Statement 1: Initial State of NFA is Initial State of DFA.