0 votes 0 votes How to convert (a+b)* into a minimal Dfa Theory of Computation theory-of-computation regular-expression finite-automata + – Srken asked Sep 4, 2022 Srken 321 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Kabir5454 commented Sep 4, 2022 reply Follow Share Do you know some theory on How we can convert regular expression to dfa ? 1 votes 1 votes Rajatagrawal commented Oct 7, 2022 reply Follow Share If ∑ ={ a,b} , then it is none other than ∑* . which contains all the strings . Just need one state which is final and also initial state . 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes one state initial as final with self loop Psy Duck answered Oct 6, 2022 Psy Duck comment Share Follow See all 0 reply Please log in or register to add a comment.