Abstract
The chamber hitting problem (CHP) for linear maps consists in checking whether an orbit of a linear map specified by a rational matrix hits a given rational polyhedral set. The CHP generalizes some well-known open computability problems about linear recurrent sequences (e.g., the Skolem problem, the nonnegativity problem). It is recently shown that the CHP is Turing equivalent to checking whether an intersection of a regular language and the special language of permutations of binary words (the permutation filter) is nonempty (\(P_{\mathbb{B}}\)E-realizability problem).
In this paper we present some decidable and undecidable problems closely related to \(P_{\mathbb{B}}\)-realizability problem thus demonstrating its ‘borderline’ status with respect to computability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bell, P., Potapov, I.: Lowering Undecidability Bounds for Decision Questions in Matrices. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 375–385. Springer, Heidelberg (2006)
Blondel, V.D., Portier, N.: The presence of a zero in an integer linear recurrent sequence is NP-hard to decide. Linear Algebra and Its Applications 351-352, 91–98 (2002)
Halava, V., Harju, T., Hirvensalo, M., Karhumäki, J.: Skolem’s problem — on the border between decidability and undecidability. TUCS Tech. Rep. No 683 (2005)
Parikh, R.J.: On context-free languages. Journal of the ACM 13(4), 570–581 (1966)
Tarasov, S., Vyalyi, M.: Orbits of linear maps and regular languages, http://arxiv.org/abs/1011.1842
Vereshchagin, N.K.: On occurrence of zero in a linear recurrent sequence. Math. notes 38(2), 177–189 (1985)
Vyalyi, M.N.: On models of a nondeterministic computation. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds.) CSR 2009. LNCS, vol. 5675, pp. 334–345. Springer, Heidelberg (2009)
Vyalyi, M., Tarasov, S.: Orbits of linear maps and regular languages. Discrete Analysis and Operations Research 17(6), 20–49 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tarasov, S., Vyalyi, M. (2011). Orbits of Linear Maps and Regular Languages. In: Kulikov, A., Vereshchagin, N. (eds) Computer Science – Theory and Applications. CSR 2011. Lecture Notes in Computer Science, vol 6651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20712-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-20712-9_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20711-2
Online ISBN: 978-3-642-20712-9
eBook Packages: Computer ScienceComputer Science (R0)