Consider the set of strings on {0,1} in which, \(every \ substring \ of \ 3 \…

PYQ GATE 2012

Consider the set of strings on {0,1} in which, every substring of 3 symbolsevery \ 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

Attempted by 252 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…