幺半群-矩阵型自动机的商自动机

Factor Automata of Monoid-Matrix Type Automata

本文从两个幺半群之间的同态出发,构造(n,S)-自动机之间的满同态,得到自动机的同余关系,进一步,在状态集的商集上,重新构造新的自动机(即所谓商自动机),并阐述了所构造的自动机与满同态所对应的自动机是同构的.在此基础上,引入(n,S)-自动机上的所谓的■和■关系,证明了这两个关系是可交换的.

In this paper,we start with a monoid homomorphism. Then we construct a n（ n,5）-automaton homomorphism and a congruence. Further,a new automaton（that is,factor automaton） is contructed on the quotient set. Also,we prove that factor automaton is isomorphic to homomorphic image. Based on these, we introduce two binary relations B and A on（ n,5）-automaton and prove that they are commutative.