Redirected
edited by
1,488 views
3 votes
3 votes

The number of states in minimal DFA for strings starting with $ab^{2}$ and ending with $b$ over the alphabet $\left \{ a,b \right \}$ is__________.

// doubt: minimal string should be $ abb $ right?

edited by

4 Answers

1 votes
1 votes
RE = abb + abb(a+b) *b

Draw a DFA for above Regular Expression

(key point is : smallest string will be 'abb')
0 votes
0 votes
6 states required as ab2 requires 4 states and b requires one state and one dead state

Related questions

1 votes
1 votes
0 answers
1
sripo asked Oct 17, 2018
1,339 views
What is the difference between a dfa accepting epsilon moves and dfa accepting nothing?I have a dfa which has no states what will be the dfa this is regarding,this questi...
1 votes
1 votes
1 answer
2
kislaya Pant asked May 8, 2018
1,064 views
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4)....
2 votes
2 votes
1 answer
4
rahul sharma 5 asked Nov 9, 2017
936 views
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}