On equations over sets of integers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

On equations over sets of integers


Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using the operations of union and addition $S+T=\makeset{m+n}{m \in S, \: n \in T}$ and with ultimately periodic constants is exactly the class of hyper-arithmetical sets. Equations using addition only can represent every hyper-arithmetical set under a simple encoding. All hyper-arithmetical sets can also be represented by equations over sets of natural numbers equipped with union, addition and subtraction $S \dotminus T=\makeset{m-n}{m \in S, \: n \in T, \: m \geqslant n}$. Testing whether a given system has a solution is $\Sigma^1_1$-complete for each model. These results, in particular, settle the expressive power of the most general types of language equations, as well as equations over subsets of free groups.
Fichier principal
Vignette du fichier
JezArtur.pdf (219.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00457025 , version 1 (16-02-2010)


  • HAL Id : inria-00457025 , version 1


Artur Jez, Alexander Okhotin. On equations over sets of integers. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.477-488. ⟨inria-00457025⟩


102 View
92 Download


Gmail Facebook Twitter LinkedIn More