Some decision problems on integer matrices
RAIRO-Theor. Inf. Appl., 39 1 (2005) 125-131
Published online: 2005-03-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Undecidability of the universal support problem for weighted automata over zero-sum-free commutative semirings
Manfred Droste and Werner KuichTheoretical Computer Science 1002 114599 (2024)
https://doi.org/10.1016/j.tcs.2024.114599
The membership problem for subsemigroups of GL2(Z) is NP-complete
Paul C. Bell, Mika Hirvensalo and Igor PotapovInformation and Computation 296 105132 (2024)
https://doi.org/10.1016/j.ic.2023.105132
14773 44 (2024)
https://doi.org/10.1007/978-3-031-64309-5_5
Semigroup Intersection Problems in the Heisenberg Groups
Ruiwen DongSIAM Journal on Discrete Mathematics 38 (4) 3176 (2024)
https://doi.org/10.1137/23M1581467
1 (2023)
https://doi.org/10.1109/LICS56636.2023.10175768
Recent Advances in Algorithmic Problems for Semigroups
Ruiwen DongACM SIGLOG News 10 (4) 3 (2023)
https://doi.org/10.1145/3636362.3636365
14235 42 (2023)
https://doi.org/10.1007/978-3-031-45286-4_4
On injectivity of quantum finite automata
Paul C. Bell and Mika HirvensaloJournal of Computer and System Sciences 122 19 (2021)
https://doi.org/10.1016/j.jcss.2021.05.002
On the Decidability of Membership in Matrix-exponential Semigroups
Joël Ouaknine, Amaury Pouly, João Sousa-Pinto and James WorrellJournal of the ACM 66 (3) 1 (2019)
https://doi.org/10.1145/3286487
Vector and scalar reachability problems in SL(2,Z)
Igor Potapov and Pavel SemukhinJournal of Computer and System Sciences 100 30 (2019)
https://doi.org/10.1016/j.jcss.2018.09.003
Freeness properties of weighted and probabilistic automata over bounded languages
Paul C. Bell, Shang Chen and Lisa JacksonInformation and Computation 269 104440 (2019)
https://doi.org/10.1016/j.ic.2019.104440
SOFSEM 2017: Theory and Practice of Computer Science
Sang-Ki Ko and Igor PotapovLecture Notes in Computer Science, SOFSEM 2017: Theory and Practice of Computer Science 10139 268 (2017)
https://doi.org/10.1007/978-3-319-51963-0_21
Theory and Applications of Models of Computation
Sang-Ki Ko and Igor PotapovLecture Notes in Computer Science, Theory and Applications of Models of Computation 10185 373 (2017)
https://doi.org/10.1007/978-3-319-55911-7_27
On the decidability of semigroup freeness
Julien Cassaigne and Francois NicolasRAIRO - Theoretical Informatics and Applications 46 (3) 355 (2012)
https://doi.org/10.1051/ita/2012010
Mathematical Foundations of Computer Science 2012
Paul C. Bell, Mika Hirvensalo and Igor PotapovLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2012 7464 148 (2012)
https://doi.org/10.1007/978-3-642-32589-2_16
On the problem of freeness of multiplicative matrix semigroups
Paweł Gawrychowski, Marin Gutan and Andrzej KisielewiczTheoretical Computer Science 411 (7-9) 1115 (2010)
https://doi.org/10.1016/j.tcs.2009.12.005
ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS
PAUL C. BELL and IGOR POTAPOVInternational Journal of Foundations of Computer Science 21 (06) 963 (2010)
https://doi.org/10.1142/S0129054110007660
Algorithms and Computation
Paul C. Bell and Igor PotapovLecture Notes in Computer Science, Algorithms and Computation 5878 657 (2009)
https://doi.org/10.1007/978-3-642-10631-6_67
UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES
VESA HALAVA, TERO HARJU and MIKA HIRVENSALOInternational Journal of Foundations of Computer Science 18 (05) 931 (2007)
https://doi.org/10.1142/S0129054107005066
On the membership of invertible diagonal and scalar matrices
Paul Bell and Igor PotapovTheoretical Computer Science 372 (1) 37 (2007)
https://doi.org/10.1016/j.tcs.2006.11.011
Some formal tools for analyzing quantum automata
Alberto Bertoni, Carlo Mereghetti and Beatrice PalanoTheoretical Computer Science 356 (1-2) 14 (2006)
https://doi.org/10.1016/j.tcs.2006.01.042