Locally complete sets and finite decomposable codes - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2002

Locally complete sets and finite decomposable codes

Résumé

We are interested in the concept of locally complete set : A subset X of the free monoid is locally complete if a code Y in A* exists, with Y different from A, X* included in Y* and both the sets X* and Y* have the same sets of factors. Our contribution is based on the three following results: A characterization of local completeness for every thin set in terms of morphic images. A polynomial time algorithm for deciding whether a finite code is locally complete. A polynomial time algorithm for deciding whether a finite maximal code is decomposable.
Fichier non déposé

Dates et versions

hal-00460321 , version 1 (26-02-2010)

Identifiants

  • HAL Id : hal-00460321 , version 1

Citer

Carla Selmi, Jean Néraud. Locally complete sets and finite decomposable codes. Theoretical Computer Science, 2002, 273, pp.185-196. ⟨hal-00460321⟩
38 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More