For any regular expression \(r\) that represents the language \(\mathcal{L}(r)\), there is a Finite automata that accepts the same language.

This implies a two-way relation where: 1. If a language is descibed by a regular expression, then it is regular; and 2. If a language is regular, then it may be described by a regular expression.