in Theory of Computation
1,897 views
1 vote
1 vote

Convert the given Finite Automata to Regular Expression.

in Theory of Computation
1.9k views

4 Comments

@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??
0
0
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)??
0
0
b(ab + c)*d
0
0

2 Answers

2 votes
2 votes

Pardon for handwriting .. Hope this helps :)

4 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.

0
0
Now I am clear tnq sir
0
0

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

0
0
0 votes
0 votes
First of all it is not DFA

In every state for every input alphabet transition is not defined

Related questions