1 votes 1 votes what is the RE of the above DFA? Theory of Computation theory-of-computation finite-automata regular-expression + – Sunil8860 asked Aug 15, 2017 Sunil8860 463 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply joshi_nitish commented Aug 15, 2017 reply Follow Share (0 + 11*0)(0 + 1)* 3 votes 3 votes akash.dinkar12 commented Aug 15, 2017 reply Follow Share take a look at it!!! 0 votes 0 votes joshi_nitish commented Aug 15, 2017 reply Follow Share @akash.dinkar12 RE should be (0+11*0)(0+1)*, you have missed brackets. 1 votes 1 votes Please log in or register to add a comment.
2 votes 2 votes Re= (0+11*0)(0+1)* Surya Dhanraj answered Aug 15, 2017 Surya Dhanraj comment Share Follow See all 0 reply Please log in or register to add a comment.