|
This article is cited in 14 scientific papers (total in 14 papers)
Linear Recurrence Equations on a Tree
A. Ya. Belovab a Moscow Institute of Open Education
b Hebrew University of Jerusalem
Abstract:
We construct an algorithm that tests a system of recurrence equations on a tree for the existence of a nontrivial solution and computes it.
Received: 22.05.2003 Revised: 09.03.2005
Citation:
A. Ya. Belov, “Linear Recurrence Equations on a Tree”, Mat. Zametki, 78:5 (2005), 643–651; Math. Notes, 78:5 (2005), 603–609
Linking options:
https://www.mathnet.ru/eng/mzm2628https://doi.org/10.4213/mzm2628 https://www.mathnet.ru/eng/mzm/v78/i5/p643
|
Statistics & downloads: |
Abstract page: | 733 | Full-text PDF : | 291 | References: | 66 | First page: | 4 |
|