Automata with finite congruence lattices

Babcsányi, István: Automata with finite congruence lattices. Acta cybernetica, (18) 1. pp. 155-165. (2007)

[img] Cikk, tanulmány, mű
Babcsanyi_2007_ActaCybernetica.pdf

Download (141kB)

Abstract

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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2007
Volume: 18
Number: 1
Page Range: pp. 155-165
ISSN: 0324-721X
Language: angol
Heading title: Regular papers
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: p. 164-165.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 05. 13:59
URI: http://acta.bibl.u-szeged.hu/id/eprint/12808

Actions (login required)

View Item View Item