A regular language over an alphabet a is one that can be obtained from
(a) union
(b) concatenation
(c) kleene
(d) All of the mentioned
The question was posed to me in an interview for internship.
The query is from Regular Language & Expression topic in chapter Regular Expressions and Languages of Automata Theory