Question Id : 18628 |
Context : UGC NET Computer Science Dec 2022 Shift II (Paper II)
In Pumping Lemma for regular languages, to say a language is satisfying pumping lemma, what is the minimum length of $y$ if you consider the string as $xyz$?
🎥 Video solution / Text Solution of this question is given below:
In pumping lemma for regular languages, a string is divided as: