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...
| Hlavní autoři: | , |
|---|---|
| Médium: | Conference item |
| Vydáno: |
IEEE
2019
|