论文信息 - Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages

Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages

The equivalence problem for languages accepted by deterministic pushdown automata is shown to be decidable if and only if the strong equivalence problem for monadic recursion schemes is decidable. The proof is obtained through a series of reductions, and several different classes of acceptors are introduced.

Emily P. Friedman | E. P. Friedman

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

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

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

[4] Daniel J. Rosenkrantz,et al. Properties of Deterministic Top-Down Grammars , 1970, Inf. Control..

[5] Alfred V. Aho,et al. The Theory of Parsing, Translation, and Compiling , 1972 .

[6] Emily P. Friedman. Deterministic languages and monadic recursion schemes , 1974, TR.

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

[8] Bruno Courcelle. Recursive Schemes, Algebraic Trees and Deterministic Languages , 1974, SWAT.