Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For example, 001110 and 011001 are in the language, but 100010 is not. All strings of length less than 3 are also in the language. A partially completed DFA that accepts this language is shown below. The missing arcs in the DFA are
δ(A,1) = B, δ(A,0) =A Δ (B, (0,1)) =C δ(C,0) = A (Initial state =A) String=”011001” is transit at which of the states?