Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests
We study the computational complexity of existential Presburger arithmetic with (possibly nested occurrences of) a Kleene-star operator. In addition to being a natural extension of Presburger arithmetic, our investigation is motivated by two other decision problems. The first problem is the rational...
Главные авторы: | Haase, C, Zetzsche, G |
---|---|
Формат: | Conference item |
Опубликовано: |
IEEE
2019
|
Схожие документы
-
Quantifier elimination for counting extensions of Presburger arithmetic
по: Chistikov, D, и др.
Опубликовано: (2022) -
Super-exponential Complexity of Presburger Arithmetic
по: Fischer, Michael J., и др.
Опубликовано: (2023) -
On the decidability of Presburger arithmetic expanded with powers
по: Karimov, T, и др.
Опубликовано: (2025) -
The complexity of Presburger arithmetic with power or powers
по: Benedikt, M, и др.
Опубликовано: (2023) -
Presburger Arithmetic with algebraic scalar multiplications
по: Philipp Hieronymi, и др.
Опубликовано: (2021-07-01)