DocumentCode :
3263083
Title :
On the decomposability of monadic algebras and automata
Author :
Bavel, Zamir ; Thomas, James W.
fYear :
1967
fDate :
18-20 Oct. 1967
Firstpage :
322
Lastpage :
335
Abstract :
The structure connections between the endomorphisms, automorphisms, and all congruence relations of an arbitrary, not necessarily finite or strongly connected automaton are investigated. It is shown how the symmetries of an automaton carry over to symmetries of the lattice of congruence relations and to symmetries of quotient automata. A Galois connection is established between the endomorphisms and the congruence relations of an automaton.
Keywords :
Algebra; Artificial intelligence; Automata; Laboratories; Lattices;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Switching and Automata Theory, 1967. SWAT 1967. IEEE Conference Record of the Eighth Annual Symposium on
Conference_Location :
Austin, TX, USA
Type :
conf
DOI :
10.1109/FOCS.1967.24
Filename :
5397193
Link To Document :
بازگشت