Equivalence problems for deterministic context-free languages and monadic recursion schemes-Reference-Cited by-同舟云学术

Equivalence problems for deterministic context-free languages and monadic recursion schemes

Published:1977-06 Issue:3 Volume:14 Page:344-359
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Friedman Emily P.

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference8 articles.

1. Decidable properties of monadic functional schemes;Ashcroft;J. Assoc. Comput. Mach.,1973

2. The algebraic theory of context-free languages;Chomsky,1963

3. Program schemes, recursion, schemes, and formal languages;Garland;J. Comput. System Sci.,1973

4. Deterministic context-free languages;Ginsburg;Inform. Contr.,1966

5. Jump pda's and hierarchies of deterministic context-free languages;Greibach;SIAM J. Comput.,1974

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

1. On the Minimization Problem for Sequential Programs;Automatic Control and Computer Sciences;2017-12

2. The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes;ACM Transactions on Computational Logic;2016-03-28

3. On the Hoare theory of monadic recursion schemes;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14

4. Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales;Moscow University Computational Mathematics and Cybernetics;2013-02-27

5. L(A)=L(B)? decidability results from complete formal systems;Theoretical Computer Science;2001-01