The hardest LL(k) language

DOI10.1007/978-3-030-81508-0_25MaRDI QIDQ832952OpenAlexFDO

Authors Mikhail Mrykhin, Alexander Okhotin

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)

Recommendations

• Hardest languages for conjunctive and Boolean grammars
• The hardest linear conjunctive language
• The hardest language for conjunctive grammars
• On the complexity of LL(k) testing
• scientific article; zbMATH DE number 3856438

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
• Boolean grammars
• 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
• Properties of deterministic top-down grammars
• The Hardest Context-Free Language

Cited in

(4)

• The hardest language for grammars with context operators
• The Hardest LL(k) Language
• The hardest language for conjunctive grammars
• Hardest languages for conjunctive and Boolean grammars

This page was built for publication: The hardest \(\operatorname{LL}(k)\) language

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