Consider the regular language L=(111 +1111)* The minimum number of sta – McqOptions

MCQOPTIONS

1.	Consider the regular language L=(111 +1111)* The minimum number of states in any DFA accepting this languages is
A.	3
B.	5
C.	8
D.	9
Answer» E.

Discussion

No Comment Found

Related MCQs

In which of the following gates, the output is 1, if and only if at least one input is 1?
If A ⊕ B = C, then
An AND circuit
A switching function is symmetric with respect to a set of literals if and only if the function remains unchanged after
<p>If at some instance prior to the occurrence of the clock edge P, Q and R have a value 0 1 and 0 respectively what shall be the value of PQR after the clock edge </p>
<p>If all the flip -flops were reset to 0 at power on what is the total number of distinct outputs (states )</p> <p>represented by PQR generated by the counter </p>
<p>The minimum number of D flip -flops needed design and a mod -258 counter is </p>
<p>What is the minimum number of gates required to implement the Boolean function (AB)+C)if we have to use only 2 -input NOR gates </p>
<p>(1217)8 is equivalent to </p>
<p>Suppose only one multiplexer and one inverter are allowed to be used to implement any boolean function of n variables What is the minimum size of the multiplexer needed </p>