The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages-Reference-Cited by-同舟云学术

The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages

Published:2014-01-30 Issue:1 Volume:55 Page:250-278
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Kanazawa Makoto,Kobele Gregory M.,Michaelis Jens,Salvati Sylvain,Yoshinaka Ryo

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00224-014-9534-z.pdf

Reference16 articles.

1. Berstel, J., Boasson, L.: Context-free languages. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 59–102. Elsevier, Amsterdam (1990)

2. Greibach, S.A.: Hierarchy theorems for two-way finite state transducers. Acta Inform. 11, 89–101 (1978)

3. Greibach, S.A.: One-way finite visit automata. Theor. Comput. Sci. 6, 175–221 (1978)

4. Groenink, A.V.: Mild context-sensitivity and tuple-based generalizations of context-free grammar. Linguist. Philos. 20(6), 607–636 (1997)

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

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

1. Weighted Multiple Context-Free Grammars;IEICE Transactions on Information and Systems;2023-03-01

2. Comparing consecutive letter counts in multiple context-free languages;Theoretical Computer Science;2021-05

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

4. Ogden's lemma, multiple context-free grammars, and the control language hierarchy;Information and Computation;2019-12

5. Pumping lemmas for classes of languages generated by folding systems;Natural Computing;2019-10-26