Comparisons between some pumping conditions for context-free languages
- 34 Downloads
We present a systematic investigation of the relationships between various pumping properties—the classic pumping condition of Bar-Hillelet al., Ogden's condition, a generalized Ogden condition of Bader and Moura, Sokolowski's condition, an extended Sokolowski condition of Grant, and linear versions of some of these conditions. We define special language operations that allow us to produce, in a systematical and uniform way, languages that satisfy some combinations of the pumping conditions but not the others. We show, among others, that the general and the linear pumping conditions are “orthogonal,” whereas the generalized Ogden condition is stronger than the extended Sokolowski condition.
KeywordsDistinguished Position Linear Version Formal Language Theory Phrase Structure Grammar Simple Phrase Structure
Unable to display preview. Download preview PDF.
- [AU]Aho, A. V., and Ullman, J. D. (1972),The Theory of Parsing, Translation, and Compiling, Vol. 1, Prentice-Hall, Englewood Cliffs, N.J.Google Scholar
- [BS2]Boonyavatana, R., and Slutzki, G. (1985), A generalized Ogden's lemma for linear context-free languages,EATCS Bull., No. 28, 20–26.Google Scholar
- [Ho2]Horváth, S. (1983), A comparison of iteration conditions on formal languages,Proc. Colloq. Algebra, Combinatorics and Logic in Computer Science, Györ, Hungary, 12–16 September, 1983 (J. Demetrovics, Gy. Katona, and A. Salomaa, eds.), Colloquia Mathematica Societatis János Bolyai, Vol. 42, J. Bolyai Math. Soc., Budapest, and North-Holland, Amsterdam, 1986, pp. 453–463.Google Scholar