Context-Free Languages and Pushdown Automata-Reference-Cited by-同舟云学术

Context-Free Languages and Pushdown Automata

Published:1997 Issue: Volume: Page:111-174
ISSN:
Container-title:Handbook of Formal Languages
language:
Short-container-title:

Author:

Autebert Jean-Michel,Berstel Jean,Boasson Luc

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-59136-5_3

Reference55 articles.

1. A. V. Aho and J. D. Ullman. The Theory of Parsing, Translation and Compiling., volume 1. Prentice-Hall, 1973.

2. J.-M. Autebert. Théorie des langages et des automates. Masson, 1994.

3. J.-M. Autebert, L. Boasson, and I. H. Sudborough. Some observations on hardest context-free languages. Technical Report 81–25, Rapport LITP, April 1981.

4. J. Berstel. Transductions and Context-Free Languages. Teubner Verlag, 1979.

5. M. Blattner and S. Ginsburg. Canonical forms of context-free grammars and position restricted grammar forms. In Karpinski, editor, Fundamentals of Computing Theory, volume 56 of Lect. Notes Comp. Sei., 1977.

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

1. Cyclic Operator Precedence Grammars for Improved Parallel Parsing;Lecture Notes in Computer Science;2024

2. Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees;Theory of Computing Systems;2023-12-20

3. Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings;Electronic Proceedings in Theoretical Computer Science;2023-09-03

4. Derivatives of Context-free Grammars with Lookahead;Journal of Information Processing;2023

5. Formal Languages and the NLP Black Box;Developments in Language Theory;2023