✦ LIBER ✦

Another simplification of the recursion scheme

✍ Scribed by Georgieva, N.

Publisher: Springer-Verlag
Year: 1977
Weight: 125 KB
Volume: 18
Category: Article
ISSN: 0003-9268
DOI: 10.1007/bf02007251

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Negative Results on the Reduction of the

Negative Results on the Reduction of the Recursion Scheme

✍ Benedetto Intrigila 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB

Monadic recursion schemes: The effect of

Monadic recursion schemes: The effect of constants

✍ Emily P. Friedman; Sheila A. Greibach 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 813 KB

The tree equivalence of linear recursion

The tree equivalence of linear recursion schemes

✍ V. Sabelfeld 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 206 KB

In the paper, a complete system of transformation rules preserving the tree equivalence and a polynomial-time algorithm deciding the tree equivalence of linear polyadic recursion schemes are proposed. The algorithm is formulated as a sequential transformation process which brings together the scheme

Transformations of unary linear recursio

Transformations of unary linear recursion schemes

✍ V. K. Sabel'fel'd 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 673 KB

Syntactic properties of recursive progra

Syntactic properties of recursive program schemes

✍ A. V. Anisimov 📂 Article 📅 1977 🏛 Springer US 🌐 English ⚖ 862 KB

A possible simplification of matrix sche

A possible simplification of matrix schemes for algorithms

✍ V. F. D'yachenko 📂 Article 📅 1969 🏛 Springer US 🌐 English ⚖ 481 KB