Regular expressions in this sense can express the regular languages, exactly the class of languages accepted by deterministic finite automata.
Expresiile regulate în acest sens pot exprima limbajele regulate, mai exact clasa limbajelor acceptate de automate finite deterministe⁠(d).