The Hardest LL(k) Language

DOI10.1142/S012905412344001XMaRDI QIDQ6169967zbMATH OpenOpenAlexFDO

Authors 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

context-free grammarsparsinghomomorphismsLL grammarsfinite transducershardest languagessimple grammars

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3673546 (Why is no real title available?)
• scientific article; zbMATH DE number 1747449 (Why is no real title available?)
• A tale of conjunctive grammars
• An extension of context-free grammars with one-sided context specifications
• Boolean grammars
• Deterministic context free languages
• Hardest languages for conjunctive and Boolean grammars
• Homomorphisms preserving deterministic context-free languages
• Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
• Le cylindre des langages linéaires
• Non-prinicipalité du cylindre des langages à compteur
• Notes on top-down languages
• On hardest languages for one-dimensional cellular automata
• On the expressive power of GF(2)-grammars
• Properties of deterministic top-down grammars
• The Hardest Context-Free Language
• The hardest \(\operatorname{LL}(k)\) language

Cited in

(1)

• The hardest language for grammars with context operators

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169967)