activity
20072026
most citedOn the decidability and complexity of Metric Temporal Logic over finite words

113 citations · 317 across the 70 of their papers we have counts for

collaborators
Showing 2024Show all

8 papers · 1 filter

math.NT2024

Transcendence of Hecke-Mahler Series

Florian Luca, Joel Ouaknine, James Worrell

We prove transcendence of the Hecke-Mahler series , where is a non-constant polynomial is a real numbe…

cs.LO2024

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 …

cs.LO2024★ 1 cited

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…

math.NT2024

Transcendence for Pisot Morphic Words over an Algebraic Base

Pavol Kebis, Florian Luca, Joel Ouaknine +2

It is known that for a uniform morphic sequence and an algebraic number such that , the number $[\![\boldsymbol{u} ]\!]…

cs.LO2024

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…

cs.SC2024

On Rational Recursion for Holonomic Sequences

Bertrand Teguia Tabuguia, James Worrell

It was recently conjectured that every component of a discrete-time rational dynamical system is a solution to an algebraic difference equation that is linear in its highest-shift…