Systolic trellis automatat†

Abstract

In the second part of this paper we discuss mainly various programming techniques for systolic automata. These techniques are used to derive theoretical results e.g. the closure of (homogeneous) systolic automaton under Boolean operations, or that every linear context free language can be accepted by a homogeneous systolic automaton and that their languages have time complexity 0(n2)