0 votes 0 votes Can someone please explain me how could we derive the RE from FA's ... Here-- https://gateoverflow.in/464/gate2008-52 PS- Obviously the answer can be easily obtained using parsing, but how can we derive the regular expression?? Ardent is too lengthy for exam point of view, so explanation with some other technique like state elimination will be appreciated... Theory of Computation finite-automata theory-of-computation expression regular-expression + – Namit Dhupar asked Dec 2, 2017 • edited Dec 2, 2017 by Namit Dhupar Namit Dhupar 726 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Sometimes state elimination become lengthy it depend on the questions nature Ram Swaroop answered Dec 22, 2018 Ram Swaroop comment Share Follow See all 0 reply Please log in or register to add a comment.