1,323 views
1 votes
1 votes

No. of states in the DFA accepting the following set of strings are:

( ( aa* + φ* )* (aa* + φ* ) + bb* + φ* φ + φ* )*

Quite confusing to me. Share your approach!

1 Answer

Best answer
6 votes
6 votes

( ( aa* + φ* )* (aa* + φ* ) + bb* + φ* φ + φ* )*

=((a+ epsilon)* (a++epsilon) + b+ + epsilon)*
=(a*a* + b*)*
=(a*+b*)*
=(a+b)*
only 1 state needed

selected by

Related questions

5 votes
5 votes
6 answers
2
dd asked Sep 24, 2016
2,989 views
$L = \left \{ a^nb \ ; n\geq 0 \right \} \cup \left \{ b^na \ ; n\geq 1 \right \}$Minimal DFA for the above language ?
1 votes
1 votes
0 answers
3
sripo asked Oct 17, 2018
1,338 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...
4 votes
4 votes
3 answers
4