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)
(B)
(C)
(D)
Answer: (D)
Explanation:
See http://www.geeksforgeeks.org/automata-theory-set-2/amp/
Quiz of this Question
Please comment below if you find anything wrong in the above post