Equations over sets of integers with addition only
From MaRDI portal
Publication:295632
DOI10.1016/j.jcss.2016.02.003zbMath1342.68185OpenAlexW2311082201MaRDI QIDQ295632
Publication date: 13 June 2016
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2016.02.003
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Complexity of equations over sets of natural numbers
- Representing hyper-arithmetical sets by equations over sets of integers
- Language equations with complementation: expressive power
- Unresolved systems of language equations: expressive power and decision problems
- The complexity of membership problems for circuits over sets of integers
- Language equations with complementation: decision problems
- Decision problems for language equations
- Unrestricted complementation in language equations over a one-letter alphabet
- On language equations with invertible operations
- Boolean grammars
- Computational completeness of equations over sets of natural numbers
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
- The complexity of membership problems for circuits over sets of natural numbers
- Decidability of trajectory-based equations
- The power of commuting with finite sets of words
- ON EQUATIONS OVER SETS OF NUMBERS AND THEIR LIMITATIONS
- CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES
- On the equivalence of linear conjunctive grammars and trellis automata
- Two Families of Languages Related to ALGOL
This page was built for publication: Equations over sets of integers with addition only
