A characterization of those automata that structurally generate finite groups - Université Paris Cité Accéder directement au contenu
Communication Dans Un Congrès Lecture Notes in Computer Science Année : 2014

A characterization of those automata that structurally generate finite groups

Résumé

Antonenko and Russyev independently have shown that any Mealy automaton with no cycles with exit--that is, where every cycle in the underlying directed graph is a sink component--generates a fi- nite (semi)group, regardless of the choice of the production functions. Antonenko has proved that this constitutes a characterization in the non-invertible case and asked for the invertible case, which is proved in this paper.
Fichier principal
Vignette du fichier
arxiv.pdf (125.59 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00877087 , version 1 (25-10-2013)

Identifiants

Citer

Ines Klimann, Matthieu Picantin. A characterization of those automata that structurally generate finite groups. 11th Latin American Theoretical INformatics Symposium (LATIN 2014), 2014, Uruguay. pp.180--189. ⟨hal-00877087⟩

Collections

UNIV-PARIS7 CNRS
179 Consultations
351 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More