Advertisement

On Non-complete Sets and Restivo’s Conjecture

  • Vladimir V. Gusev
  • Elena V. Pribavkina
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6795)

Abstract

A finite set S of words over the alphabet Σ is called non-complete if \(\textit{Fact}(S^*)\ne\Sigma^*\). A word \(w\in\Sigma^*\setminus\textit{Fact}(S^*)\) is said to be uncompletable. We present a series of non-complete sets S k whose minimal uncompletable words have length 5k 2 − 17k + 13, where k ≥ 4 is the maximal length of words in S k . This is an infinite series of counterexamples to Restivo’s conjecture, which states that any non-complete set possesses an uncompletable word of length at most 2k 2.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berstel, J., Perrin, D., Reutenauer, C.: Codes and automata. Cambridge University Press, Cambridge (2009)CrossRefzbMATHGoogle Scholar
  2. 2.
    Fici, G., Pribavkina, E., Sakarovitch, J.: On the Minimal Uncompletable Word Problem. In: CoRR (2010), http://arxiv.org/abs/1002.1928
  3. 3.
    Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)CrossRefzbMATHGoogle Scholar
  4. 4.
    Pribavkina, E.V.: Slowly synchronizing automata with zero and incomplete sets. In: CoRR (2009), http://arxiv.org/abs/0907.4576
  5. 5.
    Rampersad, N., Shallit, J., Xu, Z.: The computational complexity of universality problems for prefxes, suffixes, factors, and subwords of regular languages. In: CoRR (2009), http://arxiv.org/abs/0907.0159
  6. 6.
    Restivo, A.: Some remarks on complete subsets of a free monoid. Quaderni de ”La ricerca Scientifica”, CNR Roma 109, 19–25 (1981)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Vladimir V. Gusev
    • 1
  • Elena V. Pribavkina
    • 1
  1. 1.Ural State UniversityEkaterinburgRussia

Personalised recommendations