Hierarchy of k-context-free languages part 1 (Q3826119): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Concerning two-adjacent context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Flat Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Profile Scheduling of Opposing Forests and Level Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern selector grammars and several parsing algorithms in the context- free style / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of scheduling theory to formal language theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulating derivation forests by scheduling techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free like restrictions on selective rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generative power of regular pattern grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free grammars with selective rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pumping result for 2-context-free languages / rank
 
Normal rank

Latest revision as of 14:19, 19 June 2024

scientific article
Language Label Description Also known as
English
Hierarchy of k-context-free languages part 1
scientific article

    Statements

    Identifiers