Title :
Commutative Finite State Automaton Group (FSAG) Having Cycles over the Binary Alphabet
Author :
Bharathi, S. Jeya ; Jeyanthi, A.
Author_Institution :
Dept. of Math., Thiagarajar Coll. of Eng., Madurai, India
Abstract :
The Cartesian composition A · B of a strongly connected automaton Group A and a cyclic commutative automaton Group B is defined. It is shown that the endomorphism monoid E(A · B) of automaton A· B is a Clifford monoid. Finally, a representation of A · B is provided by regular Clifford monoid matrix type automaton. This generalizes and extends the representations of strongly connected automata and cyclic commutative automaton CCA.
Keywords :
automata theory; finite state machines; group theory; matrix algebra; Cartesian composition; Clifford monoid matrix type automaton; FSAG; binary alphabet; commutative finite state automaton group; cyclic commutative automaton; Automata; Commutation; Finite element analysis; Indium tin oxide; Lattices; Vectors; Clifford monid; Regular automaton;
Conference_Titel :
Soft Computing and Machine Intelligence (ISCMI), 2014 International Conference on
DOI :
10.1109/ISCMI.2014.35
