Finite Automata to Regular Expression.Can this be solved further?

Question

Convert the given Finite Automata to Regular Expression.

Comments

r= (bc*a)*.(bc*d) there is no need to write bc*d further whenever we want bc*d only we substitute ∊ in place of (bc*a)*.

---

$b(c+ab)^{*}d$

Check this R.E.

---

Can you please mention the steps?

---

.....

---

Just look how it is working.It is starting with b and ends with d. In between, that there are two loops c and ab.

---

@LeenSharma

We know that regular Expressions are not unique (for the same language we can write more than one Regular Expression) but when we convert FA to RE, so in this case also we will get the same RE or can be different.

Does it depends on the order in which we eliminate state??

---

Is there any sequence that we can follow for state elimination method that gives us a more better evaluated RE.

Like to get b(c+ab)∗d rather than getting (bc*a)*.(bc*d)??

---

b(ab + c)*d

Answer 1

Pardon for handwriting .. Hope this helps :)

Comments

I guess no.., (c+ab)* of b(c+ab)∗d can produce strings like abc, abcab, cab ..... so overall b(c+ab)∗d will produce babcd, babcabd, bcabd.... and none of them is produced by bc*d+b(ab) *d.

---

Now I am clear tnq sir

---

 Divya Devi   ,No need to address me as Sir, I'm just an aspirant like you. Good luck :)

Answer 2

First of all it is not DFA

In every state for every input alphabet transition is not defined