On the Computational Completeness of Equations over Sets of Natural Numbers

DOI10.1007/978-3-540-70583-3_6MaRDI QIDQ3520304zbMATH OpenOpenAlexFDO

Authors Artur Jeż, Alexander Okhotin

Publication date 19 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70583-3_6

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Recommendations

• Computational completeness of equations over sets of natural numbers
• Equations over sets of natural numbers with addition only
• Equations over sets of integers with addition only
• On equations over sets of numbers and their limitations
• scientific article; zbMATH DE number 5906488

Cited in

(22)

• Undecidability of restricted uniform recurrence equations
• Computational completeness of equations over sets of natural numbers
• Polynomial-space decidable membership problems for recurrent systems over sets of natural numbers
• Equations X + A = B and (X + X) + C = (X - X) + D over sets of natural numbers
• On equations over sets of numbers and their limitations
• One-Nonterminal Conjunctive Grammars over a Unary Alphabet
• Functions definable by arithmetic circuits
• Least and greatest solutions of equations over sets of integers
• Conjunctive Grammars with Restricted Disjunction
• On Equations over Sets of Numbers and Their Limitations
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• On the expressive power of univariate equations over sets of natural numbers
• scientific article; zbMATH DE number 6146470 (Why is no real title available?)
• Equations over sets of natural numbers with addition only
• scientific article; zbMATH DE number 2237564 (Why is no real title available?)
• Least and greatest solutions of equations over sets of integers
• Complexity of equations over sets of natural numbers
• One-nonterminal conjunctive grammars over a unary alphabet
• Representing hyper-arithmetical sets by equations over sets of integers
• Language equations with complementation: expressive power
• Conjunctive grammars with restricted disjunction
• Satisfiability of algebraic circuits over sets of natural numbers

This page was built for publication: On the Computational Completeness of Equations over Sets of Natural Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520304)