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^ n Z for n=1,2,3, … are the words in L called
A)Complement of L
B)Pumping Lemma
C)Kleene's theorem
D)None in given

Question

Quizplus · Accepted Answer

The Pumping Lemma for regular languages states that for any infinite regular language, there exist strings x, y, and z such that any string in the language can be represented as xyz, where the string y can be "pumped" (repeated) any number of times and still produce strings that belong to the language. This property is used to prove whether a language is not regular by showing a contradiction to this lemma.

Let L Be Any Infinite Regular Language, Defined Over an Alphabet