Lower bounds for context-free grammars (Q1944159): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5437181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Smallest Grammar Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all permutations by context-free grammars in Chomsky normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all permutations by context-free grammars in Greibach normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3505125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GENERATING ALL CIRCULAR SHIFTS BY CONTEXT-FREE GRAMMARS IN GREIBACH NORMAL FORM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of normal form grammars / rank
 
Normal rank

Latest revision as of 07:40, 6 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds for context-free grammars
scientific article

    Statements

    Identifiers