2 votes 2 votes Convert into regular expression using state elimination method. Theory of Computation theory-of-computation regular-expression finite-automata + – Vivek Jain asked Aug 23, 2016 Vivek Jain 899 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply papesh commented Aug 24, 2016 reply Follow Share some times it becomes hard to use state elemination method..so just find the language accepted by given dfa and build regular expression. here dfa accept: ((a+b)*(ab+aa)) 3 votes 3 votes Vishal Goyal commented Sep 3, 2016 reply Follow Share Explanation plz 0 votes 0 votes Vishal Goyal commented Sep 13, 2016 reply Follow Share Give explanation for u r answer 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes you can also use arden's theorem Hira Thakur answered Aug 31, 2016 Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.