113 citations · 317 across the 70 of their papers we have counts for
35 papers · 1 filter
On the -adic Skolem Problem
Piotr Bacik, Joël Ouaknine, David Purser +1
The Skolem Problem asks to determine whether a given linear recurrence sequence (LRS) has a zero term. Showing decidability of this problem is equivalent to giving an effective pro…
On the Decidability of Presburger Arithmetic Expanded with Powers
Toghrul Karimov, Florian Luca, Joris Nieuwveld +2
We prove that for any integers , the existential fragment of the first-order theory of the structure …
On the Decidability of Monadic Theories of Arithmetic Predicates
Valérie Berthé, Toghrul Karimov, Joris Nieuwveld +3
We investigate the decidability of the monadic second-order (MSO) theory of the structure , for various unary predicates $P_1,\ldots,P…
The 2-Dimensional Constraint Loop Problem is Decidable
Quentin Guilmant, Engel Lefaucheux, Joël Ouaknine +1
A linear constraint loop is specified by a system of linear inequalities that define the relation between the values of the program variables before and after a single execution of…
Multiple Reachability in Linear Dynamical Systems
Toghrul Karimov, Edon Kelmendi, Joël Ouaknine +1
We consider reachability decision problems for linear dynamical systems: Given a linear map on , together with source and target sets, determine whether there is a p…
Nonnegativity Problems for Matrix Semigroups
Julian D'Costa, Joel Ouaknine, James Worrell
The matrix semigroup membership problem asks, given square matrices of the same dimension, whether lies in the semigroup generated by . It is…