Generic Study on n-state Mealy Automata without Cycles
K. Thiagarajan, P. Balasubramanian, J. Padmashree · Journal of Physics Conference Series · 2018
In this paper we are studied n-state mealy automata without cycles and exit over binary alphabet {0, 1} which is isomorphic to K n Z 2 . A group of n-state mealy automata without cycles and exit over binary alphabet, is generated by permutation group of finite mealy automata under wreath recursion operation. A group of finite mealy automata have elements acts equally on words of same length are equal.