Automata with finite congruence lattices
AbstractIn 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.
Download data is not yet available.
How to Cite
Babcsányi, I. (2007). Automata with finite congruence lattices. Acta Cybernetica, 18(1), 155-165. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3710