Nonacceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata

AbstractIn this paper a contribution is given to the solution of the problem of finding an inductive characterization of the class of languages accepted by binary systolic tree automata, L(BSTA), in terms of the closure of a class of languages with respect to certain operations. It is shown that L(BSTA) is closed with respect to some new operations: selective concatenation, restricted concatenation and restricted iteration. The known nonclosure of L(BSTA) with respect to classical language operations, like concatenation and Kleene iteration is proved here by using a new nonacceptability criterion

Synthesis, structure and power of systolic computations

AbstractA variety of problems related to systolic architectures, systems, models and computations are discussed. The emphases are on theoretical problems of a broader interest. Main motivations and interesting/important applications are also presented. The first part is devoted to problems related to synthesis, transformations and simulations of systolic systems and architectures. In the second part, the power and structure of tree and linear array computations are studied in detail. The goal is to survey main research directions, problems, methods and techniques in not too formal a way