1 votes 1 votes self doubt the minimal dfa for the given regular expression over the alphabet {0,1} is 1*(0+10)*1*? Theory of Computation made-easy-test-series theory-of-computation regular-expression + – suneetha asked Dec 23, 2018 retagged Mar 3, 2019 by akash.dinkar12 suneetha 427 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Shivam Kasat commented Dec 23, 2018 reply Follow Share since the regular expression is equivalent to (1+0)*, It might contain a single state only! M I correct? 0 votes 0 votes suneetha commented Dec 23, 2018 reply Follow Share no 0 votes 0 votes Shivam Kasat commented Dec 23, 2018 reply Follow Share sorry! my fault I didn't noticed that it doesn't accept 0110, Let me go through it once more! 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes normal procedure is Draw ∈-NFA ---> DFA ----> Minimize it for this question, the minimized DFA is one more method which i learn in ACE coaching center is :- Shaik Masthan answered Dec 23, 2018 Shaik Masthan comment Share Follow See all 0 reply Please log in or register to add a comment.