Sign up ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I'm looking for the name of this theorem:

Let $P$, $Q$ be languages. Let $X$ be a language variable. Then the language equation $X=PX + Q$ (here $+$ denotes union) has a solution $X=P^*Q$, and the solution is unique if the null string doesn't belong to $P$.

share|cite|improve this question

1 Answer 1

Arden's Rule.

(That was my answer, but the rules of Stackexchange force me to continue to at least 30 characters)

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.