Cascade Connections and Triangular Products of Linear Automata

Abstract

In this note, we focus again on the basics of triangular product of automata construction and to introduce the notion of linear automata complexity. It contains three main results. (1) For any two pure automata we consider the category of their cascade connections. It possesses the universal terminal object. This object is the wreath product of the automata. Hence, every cascade connection admits a natural embedding into the wreath product of automata. (2) A similar theory is developed for linear automata, where we also consider the category of cascade connections. It also has the terminal object. This object is the triangular product of linear automata. (3) Triangular products have various applications. This construction is used in linear automata decomposition theory and in the definition of complexity of a linear automaton. We consider a special linear complexity and give the rule for its calculation.