If A and B are regular languages, !(A’ U B’) is:
(a) regular
(b) non regular
(c) may be regular
(d) none of the mentioned
This question was addressed to me during an interview.
The origin of the question is Closure Properties under Boolean Operations in chapter Properties of Regular Languages of Automata Theory