Regular expression are
(a) Type 0 language
(b) Type 1 language
(c) Type 2 language
(d) Type 3 language
This question was addressed to me during an online interview.
My question comes from Regular Language & Expression topic in section Regular Expressions and Languages of Automata Theory