Regular Language

A formal language $\mathcal{L}$ is regular iff it can be decided by a finite automaton.

Equivalently this can be expressed by being decidable by a Regular Expression.