It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
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.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Details
1 Department of Mathematics, P.S.N.A. College of Engineering and Technology, Dindigul, Tamilnadu, India.
2 Department of Mathematics, Research Scholar (Dec 2013-0323), Bharathiar University, Coimbatore, Tamilnadu, India.
3 Department of Mathematics, Research Scholar (July 2014-0285), Bharathiar University, Coimbatore, Tamilnadu, India.