The complexity of the equivalence problem for two characterizations of Presburger sets (Q1149429)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of the equivalence problem for two characterizations of Presburger sets |
scientific article; zbMATH DE number 3710145
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the equivalence problem for two characterizations of Presburger sets |
scientific article; zbMATH DE number 3710145 |
Statements
The complexity of the equivalence problem for two characterizations of Presburger sets (English)
0 references
1981
0 references
Presburger formulas
0 references
reversal-bounded multicounter machines
0 references
upper bound
0 references
deterministic time complexity
0 references
inequivalence problem
0 references
semilinear sets
0 references
Presburger relations
0 references
