4 votes 4 votes $$\begin{align*} \large\color{green}{L_1 = L\left ( a^{*}bb \right ) \cup L\left ( ab^{*}ba \right ) } \\ \end{align*}$$ Minimal DFA for $L_1$ Theory of Computation theory-of-computation minimal-state-automata finite-automata + – dd asked Dec 23, 2016 dd 909 views answer comment Share Follow See all 13 Comments See all 13 13 Comments reply Show 10 previous comments Kapil commented Dec 23, 2016 reply Follow Share @vijaycs I didn't downvote anyone :) But, thanks for rectifying me !! I was totally wrong :) 1 votes 1 votes Kapil commented Dec 23, 2016 reply Follow Share @Manojk You are always trûe :) 1 votes 1 votes vijaycs commented Dec 23, 2016 reply Follow Share @Kapil, please read my 2nd comment on this thread ..: ) 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes tell me if i made some mistake Rupendra Choudhary answered Jun 1, 2017 Rupendra Choudhary comment Share Follow See 1 comment See all 1 1 comment reply joshi_nitish commented Aug 6, 2017 reply Follow Share @Rupendra Choudhary, your dfa is accepting "aaabba", which is not in language. 0 votes 0 votes Please log in or register to add a comment.