✦ LIBER ✦

A Reduction of the Recursion Scheme

✍ Scribed by M. D. Gladstone

Book ID: 124959068
Publisher: Association for Symbolic Logic
Year: 1968
Tongue: English
Weight: 386 KB
Volume: 32
Category: Article
ISSN: 0022-4812
DOI: 10.2307/2270177

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

Simplifications of the Recursion Scheme

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

Another simplification of the recursion

Another simplification of the recursion scheme

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

A Reduction of the Recursion Schemeby M.

A Reduction of the Recursion Schemeby M. D. Gladstone

✍ Review by: Rózsa Péter 📂 Article 📅 1970 🏛 Association for Symbolic Logic 🌐 English ⚖ 227 KB

Enhancing prototype reduction schemes wi

Enhancing prototype reduction schemes with recursion: a method applicable for "large" data sets

✍ Sang-Woon Kim; Oommen, B.J. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 429 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