I have tried to convert the following DFA to regular expressions through two different methods: Arden's method, and state elimination one. I have arrived to two different regular expressions: Arden's method: $0(10)^*$. State elimination method: $0(10)^*1$
Are these two regular expressions correct for this DFA?
This is the DFA:
| 0 | 1 | |
|---|---|---|
| $\rightarrow$A : Start state | B | |
| $\leftarrow$B : Final state | A |
The first result $0(10)^*$ is correct. The second one is not, since the word $0$ should be accepted but dos not belong to $0(10)^*1$. You probably made a mistake when applying the state elimination method.