The hardest \(\operatorname{LL}(k)\) language (Q832952): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Non-prinicipalité du cylindre des langages à compteur / rank
 
Normal rank
Property / cites work
 
Property / cites work: Le cylindre des langages linéaires / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3870326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hardest Context-Free Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jump PDA’s and Hierarchies of Deterministic Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on top-down languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hardest languages for one-dimensional cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tale of conjunctive grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardest languages for conjunctive and Boolean grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of deterministic top-down grammars / rank
 
Normal rank

Latest revision as of 11:07, 28 July 2024

scientific article
Language Label Description Also known as
English
The hardest \(\operatorname{LL}(k)\) language
scientific article

    Statements

    Identifiers