A language is said to be a regular language just if it is the language expressed by some regular expression (equivalently, by some finite automaton).
A language is said to be a regular language just if it is the language expressed by some regular expression (equivalently, by some finite automaton).