Let L be any infinite regular language defined over an alphabet-04701
Let L be any infinite regular language, defined over an alphabet Σ then there exist three strings x, y<sup>n</sup> and z belonging to=Σ* such that all the strings of the form for n=1,2,3, … are the words in L. called.
This multiple choice question (MCQ) is related to the book/course
vu cs402 Theory of Automata.
It can also be found in
vu cs402 Final Term - Quiz No.12.
Let L be any infinite regular language, defined over an alphabet Σ then there exist three strings x, yn and z belonging to=Σ* such that all the strings of the form for n=1,2,3, … are the words in L. called.
Complement of L
Pumping Lemma
Kleene's theorem
None in given
