Simple context-free languages and free monadic recursion schemes-Reference-Cited by-同舟云学术

Simple context-free languages and free monadic recursion schemes

Published:1977-12 Issue:1 Volume:11 Page:9-28
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Friedman Emily P.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01768465.pdf

Reference16 articles.

1. E. Ascroft, Z. Manna andA. Puneli, Decidable Properties of Monadic Functional Schemes,JACM 20 (1973), 489–499.

2. B. Courcelle,Ensembles Algebriques d'Arbres et Languages Deterministes; quelques applications aux Schemas de Programme, IRIA/LABORIA, November 1975.

3. E. P. Friedman, Equivalence Problems for Deterministic Context-free Languages and Monadic Recursion Schemes, to Appear inJCSS.

4. S. J. Garland andD. C. Luckham, “Program Schemes, Recursion Schemes, and Formal Languages”,J. Computer and System Science 7 (1973), 119–160.

5. M. M. Geller and M. A. Harrison, Characterizations ofLR(O) Languages,14th Annual Symposium on Switching and Automata Theory, IEEE Computer Society, Iowa City, Iowa (1973), 103–108.

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

1. DPDA's in ‘atomic normal form’ and applications to equivalence problems;Theoretical Computer Science;1981

2. A simplicity test for deterministic pushdown automata;Information and Control;1980-10

3. Superdeterministic DPDAs: The method of accepting does affect decision problems;Journal of Computer and System Sciences;1979-08

4. Linearity is polynomially decidable for realtime pushdown store automata;Information and Control;1979-07

5. Monadic recursion schemes: The effect of constants;Journal of Computer and System Sciences;1979-06