Completeness results concerning systolic tree automata and E0L languages (Q674289): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3687724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systolic automata for VLSI on balanced trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a family of L languages resulting from systolic tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Kleene-like characterization of languages accepted by systolic tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis, structure and power of systolic computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Description of developmental languages using recurrence systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of systolic binary tree automata and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of some problems concerningL systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3814812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a family of acceptors for some classes of developmental languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140407 / rank
 
Normal rank

Latest revision as of 11:34, 27 May 2024

scientific article
Language Label Description Also known as
English
Completeness results concerning systolic tree automata and E0L languages
scientific article

    Statements

    Completeness results concerning systolic tree automata and E0L languages (English)
    0 references
    0 references
    0 references
    28 February 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Computational complexity
    0 references
    Formal languages
    0 references
    Tree automata
    0 references
    E0L
    0 references
    PSPACE-completeness
    0 references
    0 references