Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For examples, 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) $\begin{array}{|c|c|c|c|c|c|} \hline & 00 & 01 & 10 & 11 & Q \ \hline 00 & 1 & 0 & & & \ \hline 01 & & & & 1 & \ \hline 10 & 0 & & & & \ \hline 11 & & & 0 & & \ \hline \end{array}$
B) $\begin{array}{|c|c|c|c|c|c|} \hline & 00 & 01 & 10 & 11 & \mathrm{Q} \ \hline 00 & & 0 & & & 1 \ \hline 01 & & 1 & & & \ \hline 10 & & & & 0 & \ \hline 11 & & 0 & & & \ \hline \end{array}$
C) $\begin{array}{|c|c|c|c|c|c|} \hline & 00 & 01 & 10 & 11 & \mathrm{Q} \ \hline 00 & & 1 & & & 0 \ \hline 01 & & 1 & & & \ \hline 10 & & & 0 & & \ \hline 11 & & 0 & & & \ \hline \end{array}$
D) $\begin{array}{|c|c|c|c|c|c|} \hline & 00 & 01 & 10 & 11 & \mathrm{Q} \ \hline 00 & & 1 & & & 0 \ \hline 01 & & & & 1 & \ \hline 10 & 0 & & & & \ \hline 11 & & & 0 & & \ \hline \end{array}$

Question

Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For examples, 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) $\begin{array}{|c|c|c|c|c|c|} \hline & 00 & 01 & 10 & 11 & Q \ \hline 00 & 1 & 0 & & & \ \hline 01 & & & & 1 & \ \hline 10 & 0 & & & & \ \hline 11 & & & 0 & & \ \hline \end{array}$ 
B) $\begin{array}{|c|c|c|c|c|c|} \hline & 00 & 01 & 10 & 11 & \mathrm{Q} \ \hline 00 & & 0 & & & 1 \ \hline 01 & & 1 & & & \ \hline 10 & & & & 0 & \ \hline 11 & & 0 & & & \ \hline \end{array}$ 
C) $\begin{array}{|c|c|c|c|c|c|} \hline & 00 & 01 & 10 & 11 & \mathrm{Q} \ \hline 00 & & 1 & & & 0 \ \hline 01 & & 1 & & & \ \hline 10 & & & 0 & & \ \hline 11 & & 0 & & & \ \hline \end{array}$ 
D) $\begin{array}{|c|c|c|c|c|c|} \hline & 00 & 01 & 10 & 11 & \mathrm{Q} \ \hline 00 & & 1 & & & 0 \ \hline 01 & & & & 1 & \ \hline 10 & 0 & & & & \ \hline 11 & & & 0 & & \ \hline \end{array}$

Quizplus · Accepted Answer

The Answer of Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For examples, 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) $\begin{array}{|c|c|c|c|c|c|} \hline & 00 & 01 & 10 & 11 & Q \ \hline 00 & 1 & 0 & & & \ \hline 01 & & & & 1 & \ \hline 10 & 0 & & & & \ \hline 11 & & & 0 & & \ \hline \end{array}$ 
B) $\begin{array}{|c|c|c|c|c|c|} \hline & 00 & 01 & 10 & 11 & \mathrm{Q} \ \hline 00 & & 0 & & & 1 \ \hline 01 & & 1 & & & \ \hline 10 & & & & 0 & \ \hline 11 & & 0 & & & \ \hline \end{array}$ 
C) $\begin{array}{|c|c|c|c|c|c|} \hline & 00 & 01 & 10 & 11 & \mathrm{Q} \ \hline 00 & & 1 & & & 0 \ \hline 01 & & 1 & & & \ \hline 10 & & & 0 & & \ \hline 11 & & 0 & & & \ \hline \end{array}$ 
D) $\begin{array}{|c|c|c|c|c|c|} \hline & 00 & 01 & 10 & 11 & \mathrm{Q} \ \hline 00 & & 1 & & & 0 \ \hline 01 & & & & 1 & \ \hline 10 & 0 & & & & \ \hline 11 & & & 0 & & \ \hline \end{array}$

Consider the Set of Strings on {0,1} in Which, Every