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 ??? Theory of Computation theory-of-computation finite-automata regular-expression + – Vicky rix asked Apr 12, 2017 • retagged Jun 4, 2017 by Arjun Vicky rix 516 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply papesh commented Apr 12, 2017 reply Follow Share i think ur solution is correct! 0 votes 0 votes Arunav Khare commented Apr 12, 2017 reply Follow Share aaaba from L2 is valid but your DFA is not accepting 1 votes 1 votes papesh commented Apr 12, 2017 reply Follow Share transition is at final state 0 votes 0 votes Vicky rix commented Apr 12, 2017 reply Follow Share yeah can u post the correct answer ..? 0 votes 0 votes kapilbk1996 commented Sep 8, 2017 reply Follow Share aaabab is accepted by your DFA but it is not accepted by any of the regular expression. 0 votes 0 votes Please log in or register to add a comment.