1 votes 1 votes IF a language L(M) over a Σ={a,b} accepts strings ending with b. Language L(N) over a Σ={a,b} accepts strings ending with a. Then what is minimal DFA for L(M) Ո L(N) ? Theory of Computation theory-of-computation finite-automata minimal-state-automata + – POOJAN SHAH asked Aug 28, 2017 POOJAN SHAH 385 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes The minimal DFA will be one in which there is only one start state and no final state as the language generated by the L(M) $\bigcap$ L(N) will be $\phi$. L(M) = {b, bb, ab.......} L(N) = {a, ba, aa,......} L(M) $\bigcap$ L(N) = $\phi$ Rishabh Agrawal answered Aug 28, 2017 Rishabh Agrawal comment Share Follow See all 0 reply Please log in or register to add a comment.