0 votes 0 votes Can you please draw the DFA for given regex (ab*)* Theory of Computation theory-of-computation regular-expression finite-automata regular-language expression + – sripo asked Oct 10, 2018 sripo 656 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply sripo commented Oct 10, 2018 reply Follow Share When I tried on JFLAP conversion the RE i get is this (λ+a+(a+a)bb*)*(λ+a+(a+a)bb*) Is this correct please reply 0 votes 0 votes prerona_99 commented Dec 7, 2021 reply Follow Share This is not the correct answer since the question clearly asked to draw a DFA. In the diagram above, for every input symbol, i.e, there is no transition from state q0 on input symbol ‘b’ and similarly there is also no transition from state q1 on input symbol ‘a’. 0 votes 0 votes Please log in or register to add a comment.
Best answer 3 votes 3 votes DFA is as : Smishra95 answered Oct 10, 2018 selected Oct 10, 2018 by sripo Smishra95 comment Share Follow See all 2 Comments See all 2 2 Comments reply Ram Swaroop commented Dec 22, 2018 reply Follow Share Can not start from b 0 votes 0 votes Smishra95 commented Dec 22, 2018 reply Follow Share Thats why b is on dead state 0 votes 0 votes Please log in or register to add a comment.