Arden’s theorem state that:
“If P and Q are two regular expressions over , and if P does not contain , then the following equation in R given by R = Q + RP has an unique solution i.e., R = QP*.”
That means, whenever we get any equation in the form of R = Q + RP, then we can directly replaced by R = QP*. So, here first we will prove that R = QP* is the solution of this equation and then we will also prove that it is the unique solution of this equation.
Let’s start by taking this equation as equation (i)
R = Q + RP ......(i)
Now, replacing R by R = QP*, we get,
R = Q + QP*P
Taking Q as common,
R = Q( + P*P) R = QP*
(As we know that + R*R = R*). Hence proved.
Thus, R = QP* is the solution of the equation R = Q + RP.
Now, we have to prove that this is the only solution of this equation. Let me take this equation again:
R = Q + RP
Now, replace R by R = Q + RP,
R = Q + (Q + RP)P = Q + QP + R
Again, replace R by R = Q + RP:-
R = Q + QP + (Q + RP) = Q + QP + Q + R = ... = ... = Q + QP + Q + .. + Q + R
Now, replace R by R = QP*, we get,
R = Q + QP + Q + .. + Q + QP*
Taking Q as common,
R = Q( + P + + .. + + P*) = QP* [As + P + + .. + + P* represent the closure of P]
Thus, R = QP* is the unique solution of the equation R = Q + RP.
To understand this theorem, we will solve an example:
q1 = q1.0 + q2 = q1.1 + q2.0 q3 = q2.1 + q3.0 + q3.1
q1 = + q1.0 q1 = .0* [By Arden's theorem] q1 = 0* [R = R] .'. q2 = 0*1 +q2.0 q2 = 0*10*
[Applying Arden’s theorem]. Hence, the value of q2 is 0*10*.
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Introduction of Theory of Computation
- Pumping Lemma in Theory of Computation
- Halting Problem in Theory of Computation
- Last Minute Notes - Theory of Computation
- Chomsky Hierarchy in Theory of Computation
- Decidability Table in Theory of Computation
- Relationship between grammar and language in Theory of Computation
- Decidable and Undecidable problems in Theory of Computation
- Cauchy's Mean Value Theorem
- Kleene's Theorem in TOC | Part-1
- Quotient Remainder Theorem
- Mathematics | Rolle's Mean Value Theorem
- Mathematics | Lagrange's Mean Value Theorem
- Consensus Theorem in Digital Logic
- Arden's Theorem and Challenging Applications | Set 2
- Bayes's Theorem for Conditional Probability
- Advanced master theorem for divide and conquer recurrences
- Automata Theory | Set 7
- Automata Theory | Set 9
- Automata Theory | Set 10
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : AllenDeAlpha