The hardest \(\operatorname{LL}(k)\) language

DOI10.1007/978-3-030-81508-0_25OpenAlexW3190918431MaRDI QIDQ832952

Alexander Okhotin, Mikhail Mrykhin

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_25

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

The Hardest LL(k) Language

Cites Work

• A tale of conjunctive grammars
• Hardest languages for conjunctive and Boolean grammars
• Boolean grammars
• On hardest languages for one-dimensional cellular automata
• Non-prinicipalité du cylindre des langages à compteur
• Le cylindre des langages linéaires
• The Hardest Context-Free Language
• Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
• HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES
• Notes on top-down languages
• Properties of deterministic top-down grammars
• Unnamed Item
• Unnamed Item