Skip to content

Archives › Volume 3, Number 5 (2013)

J. Math. Comput. Sci. 3 (2013), 1335–1352

Isomorphisms on strongly connected group automaton

S. Jeya Bharathi, A. Jeyanthi

Abstract

Direct product of a permutation strongly connected automaton and a synchronizing strongly connected Aleshin Type automaton is also a strongly connected automaton. An automaton is called quasi-ideal automaton if and only if all the following conditions are satisfied; (i) It is strongly connected (ii) the minimal ideal of its transition semi group is a right group (iii) the ranges of the idempotent elements of the minimal ideal of its transition group form a merging of a partition on its set of states. An automaton is isomorphic to the direct product of a permutation strongly connected automaton and synchronizing strongly connected Aleshin type automaton if and only if it is a quasi ideal automaton.

Published
8 October 2013
Volume
3 (2013)
License
CC BY 3.0

Copyright © 2013 S. Jeya Bharathi, A. Jeyanthi. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Cite this article

S. J. Bharathi, A. Jeyanthi, Isomorphisms on strongly connected group automaton, J. Math. Comput. Sci. 3 (2013), 1335–1352.

BibTeX
@article{Bharathi2013,
  author  = {Bharathi, S. Jeya and Jeyanthi, A.},
  title   = {Isomorphisms on strongly connected group automaton},
  journal = {J. Math. Comput. Sci.},
  volume  = {3},
  year    = {2013},
  pages   = {1335--1352},
  doi     = {}
}