2 votes 2 votes Convert the following DFA to a regular expression using the state elimination techniques. Theory of Computation ullman theory-of-computation finite-automata regular-expression + – admin asked Apr 3, 2019 • edited Apr 5, 2019 by Lakshman Bhaiya admin 895 views answer comment Share Follow See 1 comment See all 1 1 comment reply Ravijha commented Jun 22, 2019 reply Follow Share how to solve this? i tried lots of times 0 votes 0 votes Please log in or register to add a comment.