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).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Paper Title
Journal
Date
