Composing short 3-compressing words on a 2-letter alphabet - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2017

Composing short 3-compressing words on a 2-letter alphabet

Résumé

A finite deterministic (semi)automaton A = (Q, Σ, δ) is k-compressible if there is some word w ∈ Σ + such that the image of its state set Q under the natural action of w is reduced by at least k states. Such word w, if it exists, is called a k-compressing word for A and A is said to be k-compressed by w. A word is k-collapsing if it is k-compressing for each k-compressible automaton, and it is k-synchronizing if it is k-compressing for all k-compressible automata with k+1 states. We compute a set W of short words such that each 3-compressible automaton on a two-letter alphabet is 3-compressed at least by a word in W. Then we construct a shortest common superstring of the words in W and, with a further refinement, we obtain a 3-collapsing word of length 53. Moreover, as previously announced, we show that the shortest 3-synchronizing word is not 3-collapsing, illustrating the new bounds 34 ≤ c(2, 3) ≤ 53 for the length c(2, 3) of the shortest 3-collapsing word on a two-letter alphabet.
Fichier principal
Vignette du fichier
dmtcs-3-coll.pdf (391.2 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01184460 , version 1 (17-08-2015)
hal-01184460 , version 2 (11-03-2017)
hal-01184460 , version 3 (01-06-2017)

Licence

Paternité - Pas d'utilisation commerciale

Identifiants

Citer

Alessandra Cherubini, Achille Frigeri, Zuhua Liu. Composing short 3-compressing words on a 2-letter alphabet. Discrete Mathematics and Theoretical Computer Science, 2017, Vol. 19 no. 1, ⟨10.23638/DMTCS-19-1-17⟩. ⟨hal-01184460v3⟩

Collections

INSMI
343 Consultations
724 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More