| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438351 | Theoretical Computer Science | 2014 | 10 Pages |
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).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Hui Xu, Jing Tian, Xianzhong Zhao,