The regular expressions over a set I are defined recursively by:
the symbol ∅ is a regular expression;
the symbol λ is a regular expression;
the symbol x is a regular expression whenever x
I ;
the symbols (AB), (A
B), and A* are regular expressions whenever A and B are regular expressions.