A tale of conjunctive grammars

DOI10.1007/978-3-319-98654-8_4OpenAlexW2887219523MaRDI QIDQ1622943

Alexander Okhotin

Publication date: 22 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-98654-8_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

The hardest \(\operatorname{LL}(k)\) language ⋮ The hardest language for grammars with context operators ⋮ Non-closure under complementation for unambiguous linear grammars ⋮ The Hardest LL(k) Language ⋮ \(\mathrm{GF}(2)\)-operations on basic families of formal languages ⋮ On hardest languages for one-dimensional cellular automata ⋮ Hardest languages for conjunctive and Boolean grammars ⋮ On hardest languages for one-dimensional cellular automata