Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth

DOI10.1007/978-3-540-74510-5_19zbMath1188.68165MaRDI QIDQ3499774

Artur Jeż, Alexander Okhotin

Publication date: 3 June 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-74510-5_19

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q80: Cellular automata (computational aspects)

68Q42: Grammars and rewriting systems