%0 Article %A Babcsányi István %D 2007 %G English %B Acta cybernetica %@ 0324-721X %T Automata with finite congruence lattices %U http://acta.bibl.u-szeged.hu/12808/1/Babcsanyi_2007_ActaCybernetica.pdf %X In this paper we prove that if the congruence lattice of an automaton A is finite then the endomorphism semigroup E(A) of A is finite. Moreover, if A is commutative then A is A-finite. We prove that if 3 ≤ |A| then a commutative automaton A is simple if and only if it is a cyclic permutation automaton of prime order. We also give some results concerning cyclic, strongly connected and strongly trap-connected automata.