GATEverse
← GATE CSE 2012

Q46

MCQ2 marks, −0.67

Consider the set of strings on {0,1}\{0,1\} in which, every substring of 33 symbols has at most two zeros. For example, 001110001110 and 011001011001 are in the language, but 100010100010 is not. All strings of length less than 33 are also in the language. A partially completed DFA that accepts this language is shown below.

Figure 1

The missing arcs in the DFA are:

Sign in to save attempts.

Loading…