retagged by
468 views
1 votes
1 votes

Construct minimal DFA for the language,L = ( L1 union L2 ) where 

L1 = L (aaa*b) and L2 = L (aab*aba*). The number of states in the minimal DFA, L is _____.

Is this correct ??? or is there anyother minimal DFA witb lesser number of states ???

retagged by

Please log in or register to answer this question.

Related questions

2 votes
2 votes
2 answers
1