Pumping lemmas for special linear languages
Benedek Nagy · University of Debrecen Electronic Archive (University of Debrecen) · 2011
Pumping lemmas give efficient way to prove that some languages do not belong to certain language classes. There are several known pumping lemmas mainly for context-free languages and some of its special cl asses. In this paper we present pumping lemmas for special linear context- free language classes where the rules of the grammar have strict restriction on their length. These lemmas can also be used in a non-standard way for regula r languages pumping the words in two places simultaneously. We are presenting such kind of applications also.