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 |
---|---|
格式: | Conference item |
出版: |
IEEE
2019
|
相似书籍
Automorphism groups of graph covers and uniform subset graphs
由: N.B. Mumba, et al.
出版: (2018-04-01)
由: N.B. Mumba, et al.
出版: (2018-04-01)
相似书籍
-
Quantifier elimination for counting extensions of Presburger arithmetic
由: Chistikov, D, et al.
出版: (2022) -
Super-exponential Complexity of Presburger Arithmetic
由: Fischer, Michael J., et al.
出版: (2023) -
On the decidability of Presburger arithmetic expanded with powers
由: Karimov, T, et al.
出版: (2025) -
The complexity of Presburger arithmetic with power or powers
由: Benedikt, M, et al.
出版: (2023) -
Presburger Arithmetic with algebraic scalar multiplications
由: Philipp Hieronymi, et al.
出版: (2021-07-01)