๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Transformations of unary linear recursion schemes

โœ Scribed by V. K. Sabel'fel'd

Publisher
Springer US
Year
1976
Tongue
English
Weight
673 KB
Volume
11
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

A general hankel-norm approximation sche
A general hankel-norm approximation scheme for linear recursive filtering
โœ Andrea Gombani; Michele Pavon ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 824 KB

A Hankel-norm approximation method for recursive estimation is developed which unifies previous work, allows for an a priori bound on the performance of the approximate filter, and permits several new applications.