Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars
- 1 January 1986
- journal article
- review article
- Published by Elsevier in Theoretical Computer Science
- Vol. 42, 1-122
- https://doi.org/10.1016/0304-3975(86)90050-2
Abstract
No abstract availableThis publication has 54 references indexed in Scilit:
- Algebraic solutions to recursion schemesJournal of Computer and System Sciences, 1987
- Varieties of ”If-Then-Else“SIAM Journal on Computing, 1983
- All solutions of a system of recursion equations in infinite trees and other contraction theoriesJournal of Computer and System Sciences, 1983
- The undecidability of a word problem: On a conjecture of strong, Maggiolo-Schettini and RosenInformation Processing Letters, 1981
- Compatible Orderings on the Metric Theory of TreesSIAM Journal on Computing, 1980
- Metric interpretations of infinite trees and semantics of non deterministic recursive programsTheoretical Computer Science, 1980
- Solutions of the Iteration Equation and Extensions of the Scalar Iteration OperationSIAM Journal on Computing, 1980
- Minimal and Optimal Computations of Recursive ProgramsJournal of the ACM, 1979
- Can programming be liberated from the von Neumann style?Communications of the ACM, 1978
- Least fixed points revisitedTheoretical Computer Science, 1976