0 votes 0 votes Q Min no. of state required by DFA to accept the string (a+b)* a(a+b)(a+b) Theory of Computation theory-of-computation + – Hradesh patel asked Jan 18, 2017 Hradesh patel 388 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Lokesh . commented Jan 19, 2017 reply Follow Share DFA will have 8 states first, construct an NFA which will have 4 states then convert it to DFA 2 votes 2 votes Hradesh patel commented Jan 19, 2017 reply Follow Share @lokesh here why go NFA then DFA why not directly.......Plz explain?? 0 votes 0 votes papesh commented Jan 19, 2017 reply Follow Share 3rd letter from right-hand side is "a" fixed so 23 states of which 4 are final and 4 are nonfinal 0 votes 0 votes Please log in or register to add a comment.