Let N (Q, , , q0, A) be the NFA recognizing a language L. Then for a – McqOptions

MCQOPTIONS

1.	Let N (Q, , , q0, A) be the NFA recognizing a language L. Then for a DFA (Q , , , q0 , A ), which among the following is true?
A.	Q = P(Q)
B.	= (R, a) = {q Q \| q (r, a), for some r R}
C.	Q = {q0}
D.	All of the mentioned
Answer» E.

Discussion

No Comment Found

Related MCQs

Let N (Q, , , q0, A) be the NFA recognizing a language L. Then for a DFA (Q , , , q0 , A ), which among the following is true?
Which of the following options is correct for the given statement?<br>Statement: If K is the number of states in NFA, the DFA simulating the same language would have states less than 2<sup>k</sup>.
Statement 1: NFA computes the string along parallel paths.<br>Statement 2: An input can be accepted at more than one place in an NFA.
Which among the following NFA s is correct corresponding to the given Language?<br>L= {x {0, 1} | 3rd bit from right is 0}
Predict the analogous operation for the given language:<br>A: {[p, q] | p A1, q does not belong to A2}
Given Language: {x | it is divisible by 3}<br>The total number of final states to be assumed in order to pass the number constituting {0, 1} is