The tree equivalence of linear recursion
โ
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