Systolic trees and systolic language recognition by tree automata

AbstractRecently K. Culik II, J. Gruska, A. Salomaa and D. Wood have studied the language recognition capabilities of certain types of systolically operating networks of processors. 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 and tree transductions can be applied in the VLSI tree theory