Iteration theorems for families of strict deterministic languages (Q1143811): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5541334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two iteration theorems for the LL(k) languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two iteration theorems for some families of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Strict Deterministic Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict deterministic grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parsing of Deterministic Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intercalation theorems for stack languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A helpful result for proving inherent ambiguity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of deterministic top-down grammars / rank
 
Normal rank

Latest revision as of 10:12, 13 June 2024

scientific article
Language Label Description Also known as
English
Iteration theorems for families of strict deterministic languages
scientific article

    Statements

    Iteration theorems for families of strict deterministic languages (English)
    0 references
    0 references
    1980
    0 references
    0 references
    strict deterministic languages
    0 references
    iteration theorems
    0 references
    simple deterministic languages
    0 references
    0 references