Which among the following are the boolean operations that under which regular languages are closed?
(a) Union
(b) Intersection
(c) Complement
(d) All of the mentioned
This question was addressed to me in an interview for internship.
Origin of the question is Closure Properties under Boolean Operations topic in division Properties of Regular Languages of Automata Theory