Unambiguous Conjunctive Grammars over a One-Letter Alphabet

DOI10.1007/978-3-642-38771-5_25zbMATH Open1381.68106OpenAlexW158673757MaRDI QIDQ5300847

Artur Jeż, Alexander Okhotin

Publication date: 28 June 2013

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38771-5_25

Mathematics Subject Classification ID

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

Related Items (5)

Unrestricted complementation in language equations over a one-letter alphabet ⋮ Input-driven languages are linear conjunctive ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ Conjunctive Grammars Can Generate Non-regular Unary Languages ⋮ One-Nonterminal Conjunctive Grammars over a Unary Alphabet

This page was built for publication: Unambiguous Conjunctive Grammars over a One-Letter Alphabet