Generic Study on n-state Mealy Automata without Cycles
In this paper we are studied n-state mealy automata without cycles and exit over binary alphabet {0, 1} which is isomorphic to KnZ2. 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 opera...
Saved in:
Published in | Journal of physics. Conference series Vol. 1000; no. 1; pp. 12162 - 12169 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Bristol
IOP Publishing
01.04.2018
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In this paper we are studied n-state mealy automata without cycles and exit over binary alphabet {0, 1} which is isomorphic to KnZ2. 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. |
---|---|
ISSN: | 1742-6588 1742-6596 |
DOI: | 10.1088/1742-6596/1000/1/012162 |