Systolic automata for VLSI on balanced trees

  title={Systolic automata for VLSI on balanced trees},
  author={Karel Cul{\'i}k and Jozef Gruska and Arto Salomaa},
  journal={Acta Informatica},
SummarySystolic tree automata with a binary (or, more generally, balanced) underlying tree are investigated. The main emphasis is on input conditions, decidability, and characterization of acceptable languages. 
Systolic Automata and P Systems
Systolic automata are models of highly-concurrent language acceptors based on identical processors with one-way flow of information, amenable to efficient hardware implementation as multiprocessor
A characterization of systolic binary tree automata and applications
This paper has two main contributions: a natural and useful characterization of systolic binary tree automata (BTA's) in terms of a simple class of Turing machines and a proof technique for showing that a language is not accepted by a BTA.
Syntactic monoids in the construction of systolic tree automata
The acceptance of regular languages by systolic tree automata is analyzed in more detail by investigating the structure of the individual processors needed, and certain properties of monoids turn out to be important.
Classes of systolic Y-tree automata and a comparison with systolic trellis automata
It is shown that for eachs≧0 the set of classes of languages accepted by SYTA whose underlying tree is a tree with base withs leaves has a maximum, called Ls SYTA, and it is proved that ifs andt are powers of the same base, thenLsSYTA=LtSYTA.
Power of interconnections and of nondeterminism in regularY-tree systolic automata
It is proved that any systolic automaton on regularY-trees is equivalent to one in the column normal form and it is shown that superstable deterministic syStolic automata over regularY -trees recognize only regular languages.
A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes
It is shown how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes implies others) and the consequences of this result are discussed.
Languages accepted by systolic Y-tree automata: structural characterizations
In this paper closure properties and decision problems for families of languages accepted by deterministic and nondeterministic systolic binary Y-tree automata are studied and some undecidability results are proved in the nond deterministic case.
Separating Real-Time and Linear Space Recognition of Languages on One-Dimensional Cellular Automata
This article shows that if all problems recognizing in space n can be recognized in time n then for every space-constructible function f all the problems that are recognizable in space f can be recognizing in time f.


VLSI systolic trees as acceptors
  • Res. Rept. CS-81-32,
  • 1981
On nonregular context-free languages and pumping
  • EATCS Bulletin 16, 22-24
  • 1982