One-Nonterminal Conjunctive Grammars over a Unary Alphabet

DOI10.1007/978-3-642-03351-3_19zbMath1248.68276OpenAlexW1508924910MaRDI QIDQ3392954

Alexander Okhotin, Artur Jeż

Publication date: 18 August 2009

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03351-3_19

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• On the expressive power of univariate equations over sets of natural numbers
• The complexity of membership problems for circuits over sets of natural numbers
• Commutative grammars: The complexity of uniform word problems
• Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
• On the Computational Completeness of Equations over Sets of Natural Numbers
• CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES
• Word Problems and Membership Problems on Compressed Words
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item