One-Nonterminal Conjunctive Grammars over a Unary Alphabet

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

Artur Jeż, Alexander Okhotin

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

68Q42: Grammars and rewriting systems

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)