0 0 votes Minimum states required for DFA that accepts : L = {w1 x w2 | w,x belongs to {a,b}* | w1 >= 0, w2 > 1 and x >= 0 }. Theory of Computation theory-of-computation minimal-state-automata number-of-states + – Na462 2.6k views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply arvin commented Sep 10, 2018 reply Follow flag 3. 0 0 replyShare ad140 commented Sep 10, 2018 reply Follow flag a*a*a+ = a+ i.e the form will be (a+b)^+ 0 0 replyShare Please log in or register to add a comment.
Best answer 3 3 votes we have, L = {w1 x w2 | w,x belongs to {a,b}* | w1 >= 0, w2 > 1 and x >= 0 }. means regular expression for L = (a+b)* (a+b)* (a+b)2(a+b)* =set of strings having length atleast 2. so number of states in minimal DFA = 3 states. arvin answered Sep 10, 2018 • selected Sep 10, 2018 by Na462 arvin comment Share Follow See all 11 Comments 11 11 Comments reply Show 8 previous comments arvin commented Sep 10, 2018 reply Follow flag @ad140 @na462 yes now u got that. :) 0 0 replyShare Shaik Masthan commented Sep 10, 2018 reply Follow flag @Na462 it's your responsibility, to select as BEST if you are satisfied with the answer 1 1 replyShare arvin commented Sep 10, 2018 reply Follow flag @shaikh :p 0 0 replyShare Please log in or register to add a comment.
