The Pumping Lemma for Well-Nested Multiple Context-Free Languages-Reference-Cited by-同舟云学术

The Pumping Lemma for Well-Nested Multiple Context-Free Languages

Published:2009 Issue: Volume: Page:312-325
ISSN:0302-9743
Container-title:Developments in Language Theory
language:
Short-container-title:

Author:

Kanazawa Makoto

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02737-6_25

Reference27 articles.

1. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Löding, C., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications, October 12 (2007), http://tata.gforge.inria.fr/

2. Engelfriet, J., Heyker, L.: The string generating power of context-free hypergraph grammars. Journa of Computer and System Sciences 43, 328–360 (1991)

3. Fisher, M.J.: Grammars with Macro-Like Productions. Ph.D. thesis, Harvard University (1968)

4. Gécseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Beyond Words, vol. 3, pp. 1–68. Springer, Berlin (1997)

5. Groenink, A.: Surface without Structure. Ph.D. thesis, Utrecht University (1997)

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cyclic Shift on Multi-component Grammars;Language and Automata Theory and Applications;2020

2. Spurious Ambiguity and Focalization;Computational Linguistics;2018-06

3. The Cooper Storage Idiom;Journal of Logic, Language and Information;2018-01-06

4. Underlying Principles and Recurring Ideas of Formal Grammars;Language and Automata Theory and Applications;2018

5. Ogden’s Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy;Language and Automata Theory and Applications;2016