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...
Main Authors: | Haase, C, Zetzsche, G |
---|---|
Format: | Conference item |
Izdano: |
IEEE
2019
|
Podobne knjige/članki
-
Quantifier elimination for counting extensions of Presburger arithmetic
od: Chistikov, D, et al.
Izdano: (2022) -
Super-exponential Complexity of Presburger Arithmetic
od: Fischer, Michael J., et al.
Izdano: (2023) -
On the decidability of Presburger arithmetic expanded with powers
od: Karimov, T, et al.
Izdano: (2025) -
The complexity of Presburger arithmetic with power or powers
od: Benedikt, M, et al.
Izdano: (2023) -
Presburger Arithmetic with algebraic scalar multiplications
od: Philipp Hieronymi, et al.
Izdano: (2021-07-01)