Tree-Manipulating Systems and Church-Rosser Theorems
Journal of the ACM (JACM)
Decidable Properties of Monadic Functional Schemas
Journal of the ACM (JACM)
Inductive methods for proving properties of programs
Communications of the ACM
Recursively defined data types: part 1
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A unified approach to global program optimization
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Semantics and axiomatics of a simple recursive language.
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Correct and optimal implementations of recursion in a simple programming language
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Tree-oriented proofs of some theorems on context-free and indexed languages
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Formal models for some features of programming languages
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Program equivalence and context-free grammars
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Recursive schemes, algebraic trees and deterministic languages
SWAT '74 Proceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)
High level languages of maximum power
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Regular expressions and the equivalence of programs
Journal of Computer and System Sciences
Translating recursion equations into flow charts
Journal of Computer and System Sciences
Characterizations of flowchartable recursions
Journal of Computer and System Sciences
On formalised computer programs
Journal of Computer and System Sciences
Program schemes, recursion schemes, and formal languages
Journal of Computer and System Sciences
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Bases for chain-complete posets
IBM Journal of Research and Development
Hi-index | 0.00 |
Tree equivalence is a relation among polyadic recursion schemes. This relation is broad enough to be interesting: equivalent schemes may not be obviously equivalent and may still differ in computationally important ways. We show that this relation is also narrow enough to imply input-output equivalence. Is tree equivalence decidable? We assign context-free grammars to recursion schemes in such a way that schemes are tree equivalent iff their grammars generate the same language. Known results on LL(k) grammars then imply that tree equivalence is decidable for a class of schemes which includes the monadic recursion schemes without constants. Some important nonmonadic schemes are also included.