Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata (Q2277854): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q3687724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677178 / 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: Q3792261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140407 / rank
 
Normal rank

Latest revision as of 16:32, 21 June 2024

scientific article
Language Label Description Also known as
English
Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata
scientific article

    Statements

    Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    This paper continues to investigate systolic tree automata introduced in \textit{K. Culik} II, \textit{J. Gruska}, \textit{A. Salomaa} [Theoretical Computer Science 23, 231-242 (1983; Zbl 0549.68081)]. Since the family of languages recognized by systolic tree automata is not closed under concatenation and Kleene iteration the authors find some restriction on these operations in order to obtain some closure properties of this language family.
    0 references
    closure properties of language classes
    0 references
    systolic tree automata
    0 references

    Identifiers