Orbits of Linear Maps and Regular Languages-Reference-Cited by-同舟云学术

Orbits of Linear Maps and Regular Languages

Published:2011 Issue: Volume: Page:305-316
ISSN:0302-9743
Container-title:Computer Science – Theory and Applications
language:
Short-container-title:

Author:

Tarasov Sergey,Vyalyi Mikhail

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-20712-9_24

Reference8 articles.

1. Lecture Notes in Computer Science;P. Bell,2006

2. 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)

3. 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)

4. Parikh, R.J.: On context-free languages. Journal of the ACM 13(4), 570–581 (1966)

5. Tarasov, S., Vyalyi, M.: Orbits of linear maps and regular languages, http://arxiv.org/abs/1011.1842

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Power of Positivity;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

2. On the decidability of finding a positive ILP-instance in a regular set of ILP-instances;Acta Informatica;2022-08

3. What’s decidable about linear loops?;Proceedings of the ACM on Programming Languages;2022-01-12

4. Algebraic Model Checking for Discrete Linear Dynamical Systems;Lecture Notes in Computer Science;2022

5. From decidability to undecidability by considering regular sets of instances;Theoretical Computer Science;2022-01