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.
C-TREE SYSTOLIC AUTOMATA / Fachini, Emanuela; M., Napoli. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - STAMPA. - 56:2(1988), pp. 155-186. [10.1016/0304-3975(88)90076-x]
C-TREE SYSTOLIC AUTOMATA
FACHINI, Emanuela;
1988
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.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
