Skip to Main content Skip to Navigation
Journal articles

On the length of shortest 2-collapsing words

Abstract : Given a word w over a finite alphabet Sigma and a finite deterministic automaton A = < Q,Sigma,delta >, the inequality vertical bar delta(Q,w)vertical bar <= vertical bar Q vertical bar - k means that under the natural action of the word w the image of the state set Q is reduced by at least k states. The word w is k-collapsing (k-synchronizing) if this inequality holds for any deterministic finite automaton ( with k + 1 states) that satisfies such an inequality for at least one word. We prove that for each alphabet Sigma there is a 2-collapsing word whose length is vertical bar Sigma vertical bar(3)+6 vertical bar Sigma vertical bar(2)+5 vertical bar Sigma vertical bar/2. Then we produce shorter 2-collapsing and 2-synchronizing words over alphabets of 4 and 5 letters.
Document type :
Journal articles
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Wednesday, May 7, 2014 - 4:15:26 PM
Last modification on : Tuesday, December 7, 2021 - 4:26:03 PM
Long-term archiving on: : Thursday, August 7, 2014 - 11:35:22 AM


Files produced by the author(s)




Alessandra Cherubini, Andrzej Kisielewicz, Brunetto Piochi. On the length of shortest 2-collapsing words. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2009, Vol. 11 no. 1 (1), pp.33--44. ⟨10.46298/dmtcs.463⟩. ⟨hal-00988185⟩



Record views


Files downloads