✦ LIBER ✦

Simplifications of the Recursion Scheme

✍ Scribed by M. D. Gladstone

Book ID: 124972637
Publisher: Association for Symbolic Logic
Year: 1971
Tongue: English
Weight: 429 KB
Volume: 36
Category: Article
ISSN: 0022-4812
DOI: 10.2307/2272468

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Another simplification of the recursion

Another simplification of the recursion scheme

✍ Georgieva, N. 📂 Article 📅 1977 🏛 Springer-Verlag ⚖ 125 KB

A Reduction of the Recursion Scheme

✍ M. D. Gladstone 📂 Article 📅 1968 🏛 Association for Symbolic Logic 🌐 English ⚖ 386 KB

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

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

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

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