subject :- theory of computation i) Convert the regular Expression into Finite automata ( 1 + 1 + 0 + 1 + 1 ) 0101 Using direct and subset construction method and convert the finite automata into Regular Expression using equation, Ardens and state elimination methods.