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...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1000; no. 1; pp. 12162 - 12169
Main Authors Thiagarajan, K., Balasubramanian, P., Padmashree, J.
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.04.2018
Subjects
Alphabets
Permutations
Physics
Online AccessGet full text

Cover

More Information
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