Applied Course | Mock GATE | Test 1 | Question: 44

Question

Minimum number of states in a deterministic Finite automata that accepts the given language is ______
$L = \{ w \mid w \text{ is any string not in } a^*b^* \}$

Answer 1

$L = \{ w \mid w \text{ is any string not in } a^*b^* \}$
$L'=\Sigma^* -L$
$L' = \{ w \mid w \text{ is any string in } a^*b^* \}$
DFA that accepts $L$ is

Number of states are $3$.
DFA for the given Language $L$ is

Minimum number of states are $3$.

Comments

'ab' is string which is in a*b*.

So this string should not be accepted. But the given DFA accepts the string 'ab'.

---

I am not sure but I think answer is 1.

you can draw DFA of (a+b)*  in one state and make that state as non final.

A DFA can have 0 final states.

---

this answer is correct.

some correction needed .

Assuming second diagram is for L'  final states should be made non final and non final states should be final