Let L be any infinite regular language, defined over an alphabet Σ then there exist three strings x, y and z belonging to Σ* such that all the strings of the form xy z n for n=1,2,3, … are the words in L. called Complement of L?
(A) Pumping Lemma
(B) Kleene’s theorem
(C) None of the given
(D) 1,2 both