C-tree systolic automata☆

https://doi.org/10.1016/0304-3975(88)90076-XGet rights and content
Under an Elsevier user license
open archive

Abstract

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.

Cited by (0)

☆

This work has been supported by a Research Grant from the Ministero della Pubblica Istruzione of Italy and by the Italian National Council of Research.

Copyright © 1988 Published by Elsevier B.V.