Equivalence of Finite Automata and

Regular Expressions Finite

Theorem. L is a regular language iff there is a regular expression R such that
L(R) = L iff there is a DFA M such that L(M) = L iff there is a NFA N such that
L(N) = L.
i.e., regular expressions, DFAs, and NFAs have the same computational power.
Proof:
Lemma 1. Given regular expression R, will construct NFA N such that L(N) = L(R)
Lemma 2. Given DFA M, will construct regular expression R such that L(M) = L(R)
Arden's theorem
Lemma 2. (Arden's theorem) Let P and Q be two regular expressions over ∑. If P does not contain €,
then the following equation in R, namely
R = Q + RP
has a unique solution (i.e. one and only one solution) given by R = QP*

Assumptions for Applying Arden’s Theorem

The transition diagram must not have NULL transitions
It must have only one initial state
Let P and Q be two regular expressions.
If P does not contain null string, then R = Q + RP has a unique solution that is R = QP*
Proof −
R = Q + (Q + RP)P [After putting the value R = Q + RP]
= Q + QP + RPP
When we put the value of R recursively, again and again, we get the following equation −
R = Q + QP + QP2 + QP3…..
R = Q (ε + P + P2 + P3 + …. )
R = QP* [As P* represents (ε + P + P2 + P3 + ….) ]
Hence, proved.