Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth

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

Alexander Okhotin, Artur Jeż

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

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80) Grammars and rewriting systems (68Q42)

Related Items (6)

A game-theoretic characterization of Boolean grammars ⋮ Locally stratified Boolean grammars ⋮ Conjunctive Grammars with Restricted Disjunction ⋮ A Game-Theoretic Characterization of Boolean Grammars ⋮ On Equations over Sets of Numbers and Their Limitations ⋮ One-Nonterminal Conjunctive Grammars over a Unary Alphabet

This page was built for publication: Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth