On the Complexity of Pumping

Since the beginning of automata and formal language theory, researchers have studied pumping properties of formal languages in order to gain a better understanding of the computational complexity and the expressive power of various types of language accepting or generating mechanisms. The first part of this monograph studies the descriptional complexity of minimal pumping constants-the smallest value that satisfies a previously fixed pumping lemma-by comparing the constants according to various pumping lemmata. This results in a complete hierarchy of measures for regular languages. The simultaneous regulation of minimal pumping constants and other measures is improved and their operational complexity analyzed. The second part is dedicated to the computational complexity of the Pumping-Problem, that is, for a given grammar G and a value p, to decide whether the language L(G) satisfies a previously fixed pumping lemma w.r.t. the value p. Among other results, we show that the problem is decidable but computationally intractable for all studied pumping lemmata, if the language under consideration is regular, a k-rated linear language or a well-matched visibly pushdown language, and the problem becomes undecidable if the language is (linear) context-free.