The Hardest LL(k) Language

DOI10.1142/s012905412344001xOpenAlexW4323256271MaRDI QIDQ6169967

Mikhail Mrykhin, Alexander Okhotin

Publication date: 15 August 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905412344001x

zbMATH Keywords

homomorphismscontext-free grammarsparsingLL grammarsfinite transducershardest languagessimple grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

The hardest language for grammars with context operators

Cites Work

• Unnamed Item
• Unnamed Item
• The hardest \(\operatorname{LL}(k)\) language
• A tale of conjunctive grammars
• Hardest languages for conjunctive and Boolean grammars
• Boolean grammars
• On the expressive power of GF(2)-grammars
• On hardest languages for one-dimensional cellular automata
• An extension of context-free grammars with one-sided context specifications
• 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
• Deterministic context free languages
• Notes on top-down languages
• Properties of deterministic top-down grammars

This page was built for publication: The Hardest LL(k) Language