Question

What language does the following DFA compute?

• A. {w| w is a string that contains one or three 1's}
• B. {w|w is a string that does not contain exactly two 0's}
• C. {w| w is a string that contains one or three 0's}
• D. {w | w is string that does not contain more than four 0's}

Answer 1

The correct option is B {w|w is a string that does not contain exactly two 0's}

The given DFA accepts all the strings that does not contain exactly two 0's.