A kleene-like characterization of languages accepted by systolic tree automata

摘要

We present a Kleen-like characterization of the class of languages accepted by systolic binary tree automata, L(SBTA). This characterization uses union, intersection, restricted concatenation, restricted concatenation closure, and finite substitution closure. The restrictions we impose on the operator of concatenation are purely in terms of the length of the words to be concatenated.