Monoid-matrix type automata

Authors:
Hui Xu;Jing Tian;Xianzhong Zhao
Affiliations:
Department of Mathematics, Northwest University, Xian, Shaanxi, 710127, PR China and School of Science, Air Force Engineering University, Xian, Shaanxi, 710051, PR China;School of Science, Xian University of Technology, Xian, Shaanxi, 710048, PR China;College of Mathematics and Information Science, Jiangxi Normal University, Nanchang, Jiangxi, 330022, PR China
Venue:
Theoretical Computer Science
Year:
2014

Citing 10
Cited 0

The Structure of an Automaton and Its Operation-Preserving Transformation Group

Journal of the ACM (JACM)
Isomorphism Groups of Automata

Journal of the ACM (JACM)
The Automorphism Group of the Direct Product of Strongly Related Automata

Journal of the ACM (JACM)
Groups of Automorphisms and Sets of Equivalence Classes of Input for Automata

Journal of the ACM (JACM)
On the Automorphism Group of an Automaton

Journal of the ACM (JACM)
Group-Type Automata

Journal of the ACM (JACM)
Algebraic Theory of Automata & Languages

Algebraic Theory of Automata & Languages
A structure theory of automata characterized by groups

Journal of Computer and System Sciences
Representations of commutative asynchronous automata

Journal of Computer and System Sciences
Algebraic structures of automata

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

Monoid-matrix type automata are introduced and studied in this paper. We give a characterization of the cyclic monoid-matrix type automata and the regular monoid-matrix type automata. Also, we provide a method to determine the structures of canonical S@?-automata (canonical C-automata, respectively) whose endomorphism monoids are isomorphic to a given finite meet semilattice with the greatest element (Clifford monoid, respectively).