The hardest LL(k) language

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

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Notes on top-down languages
• Boolean grammars
• Title not available (Why is that?)
• The Hardest Context-Free Language
• Properties of deterministic top-down grammars
• Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
• A tale of conjunctive grammars
• Hardest languages for conjunctive and Boolean 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

Cited In (1)

• The Hardest LL(k) Language

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)