Systolic tree automata are very efficient acceptors, since they operate in logarithmic time and the number of processors is 0(n). (This is achieved by letting ...

In this paper we study systolic Y-tree automata (SYTA), a class of systolic automata where the communication structure is obtained by adding new edges, and ...

Systolic tree acceptors ; Bi-infinitary codes. Do Long Van · 1990 ; On a class of infinitary codes. RAIRO-Theor. Inf. Appl. · 1990 ; On frontiers of regular trees.

Introduction des automates systoliques pour VLSI comme accepteurs avec un grand degre de parallelisme concentre l'attention sur les automates d'arbres.

Systolic tree acceptors · KCKarel Ii Culik. Karel Ii Culik · ASArto Salomaa. Arto Salomaa · DWDerick Wood. Derick Wood.

In the abstract and keywords of this paper, some words with hyperlinks and icons of "China Species Library" have been matched with the corresponding entries in ...

Here their model for systolic VLSI trees is formalized in terms of standard tree automaton theory, and we show how some known facts about recognizable forests ...

We present a Kleen-like characterization of the class of languages accepted by systolic binary tree automata, L(SBTA). This characterization uses union, ...

Systolic automata as recognizers of nitary lan- guages have been largely investigated (e.g. see [5]), but they have never been considered as acceptors of in ...

Systolic automata are models of highly-concurrent language acceptors based on identical processors with one-way flow of information, amenable to efficient ...