closed by
4,116 views
0 votes
0 votes
closed with the note: Query resolved. Correct answer is 3.
The Minimum DFA that accepts the given language is ____

L = { w | w is any string not in a*b*}
closed by

Related questions

1 votes
1 votes
1 answer
1
iarnav asked Aug 18, 2017
1,387 views
Consider the regular language L=(00+0000)* . The minimum number of states in any DFA accepting this languages is?
0 votes
0 votes
1 answer
4
Amit Sharma asked Jun 7, 2016
1,484 views
L =Set of all string which starts with a and ends with a .what will be the min no of states in FA represented by this Lang.