Representing Hyper-arithmetical Sets by Equations over Sets of Integers

  title={Representing Hyper-arithmetical Sets by Equations over Sets of Integers},
  author={Artur Jeż and Alexander Okhotin},
  journal={Theory of Computing Systems},
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, defined as S+T={m+n∣m∈S,n∈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… 

Least and greatest solutions of equations over sets of integers

On language equations with concatenation and various sets of Boolean operations

  • A. Okhotin
  • Computer Science
    RAIRO Theor. Informatics Appl.
  • 2015
It is determined that different sets of Boolean operations give rise to exactly seven families of formal languages: the recursive languages, the conjunctive languages, a certain family incomparable with the context-free languages, as well as three subregular families.

Equations X + A = B and (X + X) + C = (X - X) + D over Sets of Natural Numbers

It is shown that the same expressive power, under a certain encoding, can be achieved by systems of just two equations, X+A=B and (X+X)+C=(X−X)+D, without using union.

Conjunctive and Boolean grammars: The true general case of the context-free grammars

Computable fixpoints in well-structured symbolic model checking

A general finite-time convergence theorem for fixpoint expressions over a well-quasi-ordered set is proved, which has immediate applications for the verification of well-structured systems and game-theoretical properties and probabilistic systems where nesting and alternation of least and greatest fixpoints are common.

Language equations

Numbers and Languages



Equations over Sets of Natural Numbers with Addition Only

It is shown that for every recursive (r.e.) set $S \subseteq \mathbb{N}$ there exists a system with a unique (least, greatest) solution containing a component $T$ with $S=\ensuremath{ \{ n \: | \: 16n+13 \in T \} }$.

The complexity of membership problems for circuits over sets of integers

Least and greatest solutions of equations over sets of integers

Complexity of Equations over Sets of Natural Numbers

The general membership problem for equations of the form Xi=φi (X1,…,Xn) (1≤i≤n) is proved to be EXPTIME-complete, and it is established that least solutions of all such systems are in EXPTime.

On the Computational Completeness of Equations over Sets of Natural Numbers

Systems of equations of the form φ j (X 1 , ..., X n ) = i¾? j (X 1 , ..., X n ) with $1 \leqslant j \leqslant m$ are considered, in which the unknowns X i are sets of natural numbers, while the

The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers

The problem of testing membership in the subset of the natural numbers produced at the output gate of a combinational circuit is shown to capture a wide range of complexity classes, and results extend in nontrivial ways past work by Stockmeyer and Meyer, Wagner, Wagner and Yang.

Conjunctive Grammars Can Generate Non-regular Unary Languages

  • Artur Jeż
  • Linguistics
    Developments in Language Theory
  • 2007
A negative answer is given, contrary to the conjectured positive one, by constructing a conjunctive grammar for the language \(\{ a^{4^{n}} : n \in \mathbb{N} \}\).

Unresolved systems of language equations: Expressive power and decision problems

One-Nonterminal Conjunctive Grammars over a Unary Alphabet

The compressed membership problem for one-nonterminal conjunctive grammars over {a} is proved to be EXPTIME-complete; the same problem for the context-free grammar is decidable in NLOGSPACE, but becomes NP-complete if the grammar is compressed as well.