C-tree systolic automata (Q1102750)

From MaRDI portal
Revision as of 16:16, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    systolic automaton
    0 references
    Lindenmayer EPT0L languages
    0 references
    sequential machines
    0 references
    0 references
    0 references

    Identifiers