|
Diskretnyi Analiz i Issledovanie Operatsii, 2010, Volume 17, Issue 6, Pages 20–49
(Mi da628)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
Orbits of linear maps and regular languages properties
M. N. Vyalyi, S. P. Tarasov Computational Center of RAS, Moscow, Russia
Abstract:
We establish equivalence of two recognition problems: hitting of a polyhedral set by an orbit of a linear map and nonemptiness of the intersection of a regular language and the language of binary words permutations (the permutation filter). Decidability is unknown for both problems. The hitting problem generalizes well-known Skolem and nonnegativity problems that are formulated in terms of linear recurrence sequences. Bibliogr. 14.
Keywords:
linear recurrence sequence, linear map, orbit, regular language, algorithmic decidability.
Received: 11.05.2010
Citation:
M. N. Vyalyi, S. P. Tarasov, “Orbits of linear maps and regular languages properties”, Diskretn. Anal. Issled. Oper., 17:6 (2010), 20–49; J. Appl. Industr. Math., 5:3 (2011), 448–465
Linking options:
https://www.mathnet.ru/eng/da628 https://www.mathnet.ru/eng/da/v17/i6/p20
|
|