A characterization of complete finite prefix codes in an arbitrary submonoid of A - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Automata Languages and Combinatorics Année : 2004

A characterization of complete finite prefix codes in an arbitrary submonoid of A

Résumé

Given an arbitrary submonoid M of the free monoid A*, and given a subset X of M, X is weakly M-complete if any word of M is a factor of some word in X*. The submonoid X* itself is weakly M-dense. We apply two results from [8,9] for obtaining a new characterization of the existence of a finite weakly M-complete prefix set: such a set exists iff M itself is weakly dense in its right unitary hull. This leads to an efficient algorithmic for deciding whether a given finite prefix subset of a finitely generated submonoid M is (weakly) M-complete.
Fichier non déposé

Dates et versions

hal-00461875 , version 1 (06-03-2010)

Identifiants

  • HAL Id : hal-00461875 , version 1

Citer

Carla Selmi, Jean Néraud. A characterization of complete finite prefix codes in an arbitrary submonoid of A. Journal of Automata Languages and Combinatorics, 2004, 9, pp.103-110. ⟨hal-00461875⟩
49 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More