The amalgamation of automata

摘要

By introducing the concept of the amalgamation of automata, we discuss their structure and classification in terms of characteristic semigroups, when the input is a free semigroup generated by a set of input symbols. We demonstrate in this paper a direct product decomposability of automata, and discuss the hierarchy of automata which is characterized by the characteristic semigroups.