If L is a regular language, then (((L’)r)’)* is:
(a) regular
(b) non regular
(c) may be regular
(d) none of the mentioned
I got this question in my homework.
This key question is from Closure Properties under Boolean Operations topic in section Properties of Regular Languages of Automata Theory