0 votes 0 votes What is meant by ‘pumping length’ and how can we find it? Theory of Computation theory-of-computation pumping-lemma + – atulcse asked Jan 28, 2022 atulcse 576 views answer comment Share Follow See 1 comment See all 1 1 comment reply Kabir5454 commented Jan 28, 2022 reply Follow Share https://gateoverflow.in/302833/Gate-cse-2019-question-15?show=303049#a303049 read this answer by sachin sir and below comment by deepak sir . I don't think you need anything more than that. They have provided some resources as well you can check that. 2 votes 2 votes Please log in or register to add a comment.
2 votes 2 votes @atulcse Pumping lemma for regular languages, the fact that all sufficiently long strings in such a language have a substring that can be repeated arbitrarily many times, usually used to prove that certain languages are not regular... The pumping lemma is often used to prove that a given language L is non-context-free, by showing that arbitrarily long strings s are in L that cannot be "pumped" without producing strings outside L... 1. https://gateoverflow.in/27476/What-is-the-minimum-pumping-length-the-following-languages 2. http://web.cs.unlv.edu/larmore/Courses/CSC456/pumping.pdf 3. https://gateoverflow.in/241418/Pumping-lemma 4. https://en.wikipedia.org/wiki/Pumping_lemma_for_context-free_languages#Usage_of_the_lemma aaa 1 answered Jan 28, 2022 aaa 1 comment Share Follow See all 0 reply Please log in or register to add a comment.
