The Gateway to Computer Science Excellence
0 votes
156 views
The Minimum DFA that accepts the given language is ____

L = { w | w is any string not in a*b*}
closed with the note: Query resolved. Correct answer is 3.
in Theory of Computation by (239 points)
closed by | 156 views
0
4?
0
Yes it should be 4
0

Is the procedure ok ? @Verma Ashish .

You can create a DFA for a*b* including the rejected state , and then complement it by making all final as non-final and vice versa.

0
Yes.. Whatever way we do final minimal dfa is same.
+1
only three state
0
4 se kum mei naa ho payega
0
Yeah
+1
when we are minimize the dfa then over all three state in this case q2 and q3 merge
+2

I got the answer as 4 too but this the solution that they provided. Someone please confirm whether it is correct or not

+1
100% true
+1
oh yes  ..my mistake. given solution is correct.
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,352 answers
198,474 comments
105,244 users