Balanced Grammars and Their Languages-Reference-Cited by-同舟云学术

Balanced Grammars and Their Languages

Published:2002 Issue: Volume: Page:3-25
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Berstel Jean,Boasson Luc

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45711-9_1

Reference10 articles.

1. J. Berstel and L. Boasson. XML-grammars. In MFCS 2000 Mathematical Foundations of Computer Science (M. Nielsen and B. Rovan, Eds.), Springer-Verlag, Lect. Notes Comput. Sci. 1893, pages 182–191, 2000.

2. J.H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971.

3. N. Chomsky and M.P. Schützenberger. The Algebraic Theory of Context-Free Languages. In Computer Programming and Formal Systems (P. Braffort and D. Hirschberg, Eds.), North-Holland, Amsterdam, pages 118–161, 1963.

4. S. Ginsburg and M.A. Harrison. Bracketed Context-Free Languages. J. Comput. Syst. Sci., 1:1–23, 1967.

5. Michael A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass., 1978.

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

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

2. Homomorphic Characterizations of Indexed Languages;Language and Automata Theory and Applications;2016

3. Complexity of input-driven pushdown automata;ACM SIGACT News;2014-06-09

4. Sofic-Dyck Shifts;Mathematical Foundations of Computer Science 2014;2014

5. Logic Characterization of Invisibly Structured Languages: The Case of Floyd Languages;Lecture Notes in Computer Science;2013