Orbits of Linear Maps and Regular Languages
From MaRDI portal
Publication:3007635
DOI10.1007/978-3-642-20712-9_24zbMath1332.68130arXiv1011.1842MaRDI QIDQ3007635
Mikhail N. Vyalyi, Sergey P. Tarasov
Publication date: 17 June 2011
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.1842
Related Items
On the decidability of finding a positive ILP-instance in a regular set of ILP-instances, What's decidable about discrete linear dynamical systems?, From decidability to undecidability by considering regular sets of instances, Algebraic model checking for discrete linear dynamical systems, Orbits of Linear Maps and Regular Languages
Cites Work
- Unnamed Item
- Occurrence of zero in a linear recursive sequence
- The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
- Orbits of Linear Maps and Regular Languages
- On Models of a Nondeterministic Computation
- Lowering Undecidability Bounds for Decision Questions in Matrices
- On Context-Free Languages