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:

The membership problem for subsemigroups of GL2(Z) is NP-complete

Paul C. Bell, Mika Hirvensalo and Igor Potapov
Information and Computation 296 105132 (2024)
https://doi.org/10.1016/j.ic.2023.105132

Freeness properties of weighted and probabilistic automata over bounded languages

Paul C. Bell, Shang Chen and Lisa Jackson
Information and Computation 269 104440 (2019)
https://doi.org/10.1016/j.ic.2019.104440

On the Decidability of Membership in Matrix-exponential Semigroups

Joël Ouaknine, Amaury Pouly, João Sousa-Pinto and James Worrell
Journal of the ACM 66 (3) 1 (2019)
https://doi.org/10.1145/3286487

Theory and Applications of Models of Computation

Sang-Ki Ko and Igor Potapov
Lecture 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

SOFSEM 2017: Theory and Practice of Computer Science

Sang-Ki Ko and Igor Potapov
Lecture 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

On the decidability of semigroup freeness

Julien Cassaigne and Francois Nicolas
RAIRO - 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 Potapov
Lecture 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 UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS

PAUL C. BELL and IGOR POTAPOV
International Journal of Foundations of Computer Science 21 (06) 963 (2010)
https://doi.org/10.1142/S0129054110007660

On the problem of freeness of multiplicative matrix semigroups

Paweł Gawrychowski, Marin Gutan and Andrzej Kisielewicz
Theoretical Computer Science 411 (7-9) 1115 (2010)
https://doi.org/10.1016/j.tcs.2009.12.005

UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES

VESA HALAVA, TERO HARJU and MIKA HIRVENSALO
International Journal of Foundations of Computer Science 18 (05) 931 (2007)
https://doi.org/10.1142/S0129054107005066