论文信息 - Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes

Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes

The equivalence problem for deterministic context-free languages is shown to be decidable if and only if the strong equivalence problem for monadic recursion schemes is decidable.

Emily P. Friedman | E. P. Friedman

[1] John E. Hopcroft,et al. Simple Deterministic Languages , 1966, SWAT.

[2] Ivan M. Havel,et al. Strict Deterministic Grammars , 1973, J. Comput. Syst. Sci..

[3] Seymour Ginsburg,et al. Deterministic Context Free Languages , 1966, Inf. Control..

[4] Stephen J. Garland,et al. Program Schemes, Recursion Schemes, and Formal Languages , 1973, J. Comput. Syst. Sci..

[5] Noam Chomsky,et al. The Algebraic Theory of Context-Free Languages* , 1963 .

[6] Zohar Manna,et al. Decidable Properties of Monadic Functional Schemas , 1973, JACM.

[7] Sheila A. Greibach,et al. Jump PDA's and Hierarchies of Deterministic Context-Free Languages , 1974, SIAM J. Comput..

[8] Richard R. Muntz,et al. Stack Replacement Algorithms for Two-Level Directly Addressable Paged Memories , 1974, SIAM J. Comput..

[9] Arnold L. Rosenberg,et al. Real-Time Definable Languages , 1967, JACM.