If L is a regular language, L^c and L^r both will be:
(a) Accepted by NFA
(b) Rejected by NFA
(c) One of them will be accepted
(d) Cannot be said
I have been asked this question in homework.
I want to ask this question from The Language of NFA topic in division Finite Automata of Automata Theory