0 votes 0 votes What will be the regular expression for following fa using recurrence relation method. Theory of Computation theory-of-computation regular-expression finite-automata + – nbhatt asked Sep 21, 2022 nbhatt 384 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Sumit Singh Dhami commented Sep 21, 2022 reply Follow Share Don’t know recurrence relation method but you can do this by removal of states method. On removing state 2 you will get $(r1 +r_2r_4^*r_3)^*$ 1 votes 1 votes nbhatt commented Sep 21, 2022 reply Follow Share Can we solve this using kleens theorem? 0 votes 0 votes Abhrajyoti00 commented Sep 21, 2022 reply Follow Share @nbhatt The easiest way to do these qs is, go to the final state and write all the loops in it as union (+) sign and then use * to generate infinite of them just like @Sumit Singh Dhami has done. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes We can also use arden's theorem to converting F.A to R.E Nisha Bharti answered Sep 21, 2022 Nisha Bharti comment Share Follow See all 3 Comments See all 3 3 Comments reply Nisha Bharti commented Sep 21, 2022 reply Follow Share Btw why are you considering 4 different inputs for this machine? 0 votes 0 votes nbhatt commented Sep 21, 2022 reply Follow Share Can we use kleen theorem? 0 votes 0 votes Nisha Bharti commented Sep 21, 2022 reply Follow Share @nbhatt No Kleene's Theorem states that: every regular language may be recognized by some FA, and every FA, language may be represented using a regular expression.(simply by the use of union, intersection, concatenation, kleen closure ..etc) infact in Ardens thorem we also used these union, closure but here is restrictions Conditions- To use Arden’s Theorem, following conditions must be satisfied- The transition diagram must not have any ∈ transitions. There must be only a single initial state. so for constructing regular expression from finite automata we have to use either State elimination method or Arden’s theorem. 0 votes 0 votes Please log in or register to add a comment.