On the recognition of the finite definiteness of an automation monomial algebra

In this paper an algorithm for recognition of finite definiteness of an automaton monomial algebra is proposed. It is shown that this problem for an arbitrary algebra reduces to the following problems: determination of the star height of a regular language and finite definiteness recognition for a certain class of automaton algebras. The solution of the former problem has already been described in the literature, the complete solution of the latter problem is presented in this paper.