C-tree systolic automata (Q1102750): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental properties of infinite trees / 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: Systolic trellis automatat† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3687724 / 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: Q4140407 / rank
 
Normal rank

Latest revision as of 17:16, 18 June 2024

scientific article
Language Label Description Also known as
English
C-tree systolic automata
scientific article

    Statements

    C-tree systolic automata (English)
    0 references
    1988
    0 references
    A new type of systolic automaton is introduced, its structural properties such as homogeneity and stability, are investigated and the class of languages accepted by these automata is studied. This class of languages, in the nondeterministic case, contains a large subclass of the Lindenmayer EPT0L languages. A characterization of the defined model is also given in terms of sequential machines.
    0 references
    0 references
    systolic automaton
    0 references
    Lindenmayer EPT0L languages
    0 references
    sequential machines
    0 references
    0 references
    0 references