1. Context-free languages and pushdown automata;Autebert,1997
2. A generalization of Ogden's lemma;Bader;J. ACM,1982
3. On formal properties of simple phrase-structure grammars;Bar-Hillel;Zeitschrift für Phonetik, Sprachwissenschaft, und Kommunikationsforschung,1981
4. A generalized Ogden's lemma for linear context-free languages;Boonyavatana;EATCS Bull.,1985
5. The interchange or pump (di)lemmas for context-free languages;Boonyavatana;Theoret. Comput. Sci.,1988