0 votes 0 votes What will be the Regular Expression obtained from this Finite Automata? Theory of Computation theory-of-computation regular-expression finite-automata + – Namit Dhupar asked Nov 25, 2017 Namit Dhupar 575 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Surajit commented Nov 25, 2017 reply Follow Share use state elimination method, or try manually test and trail. I got c*a(bc*a+d)* .I eliminated state q1 first,you can have other one also.Not sure if I made any mistake in between. 1 votes 1 votes Praveen Saini commented Nov 25, 2017 reply Follow Share Regular expression is correct. another one is (c+ad*b)*ad* In state elimination, we cannot eliminate the start state and final state. 2 votes 2 votes Please log in or register to add a comment.
2 votes 2 votes Regular Expression of above finite automata is c*a(d+bc*a)* In the finite automata first c comes many times and then a ,after a there is choice First choice is d or bc*a or Kleene closure of (d+bc*a) Anurag Tiwari 1 answered Nov 25, 2017 Anurag Tiwari 1 comment Share Follow See all 0 reply Please log in or register to add a comment.
