Regular Language

A regular language over a an alphabet $\Sigma$ is the smallest Formal Language of $\mathcal{P}(\Sigma^{*})$ that

• Contains the empty language $\emptyset$
• Contains all singleton languages $\left\{\;a\right\}$
• Is closed under union, concatenation, and Kleene Star.