Regular languages

$$(-+\Lambda) D D^{\ast} (\Lambda+.D^{\ast}), D \ \text{stands for digit}$$

$$\emptyset, \{\Lambda\} \text{ and } \{a\} \text{ are regular languages for all } a \in \Sigma$$