The Hardest LL(k) Language

DOI10.1142/S012905412344001XOpenAlexW4323256271MaRDI QIDQ6169967FDOQ6169967

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

• Deterministic context free languages
• Notes on top-down languages
• Boolean grammars
• Title not available (Why is that?)
• The Hardest Context-Free Language
• Properties of deterministic top-down grammars
• An extension of context-free grammars with one-sided context specifications
• Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
• A tale of conjunctive grammars
• Hardest languages for conjunctive and Boolean grammars
• On the expressive power of GF(2)-grammars
• On hardest languages for one-dimensional cellular automata
• Title not available (Why is that?)
• Non-prinicipalité du cylindre des langages à compteur
• Le cylindre des langages linéaires
• Homomorphisms preserving deterministic context-free languages
• 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)