Advertisement

Hard Counting Problems for Partial Words

  • Florin Manea
  • Cătălin Tiseanu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6031)

Abstract

In this paper we approach several decision and counting problems related to partial words, from a computational point of view. First we show that finding a full word that is not compatible with any word from a given list of partial words, all having the same length, is NP-complete; from this we derive that counting the number of words that are compatible with at least one word from a given list of partial words, all having the same length, is #P-complete. We continue by showing that some other related problems are also #P-complete; from these we mention here only two: counting all the distinct full words of a given length compatible with at least one factor of the given partial word, and counting all the distinct squares compatible with at least a factor of a given partial word.

Keywords

Partial Words NP-completeness #P Complexity Class #P-complete Problems Combinatorics on Words 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Allouche, J.P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)zbMATHCrossRefGoogle Scholar
  2. 2.
    Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theoretical Computer Science 218, 135–141 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC Press (2008)Google Scholar
  4. 4.
    Blanchet-Sadri, F., Anavekar, A.R.: Testing primitivity on partial words. Discrete Applied Mathematics 155(3), 279–287 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Blanchet-Sadri, F., Mercaş, R., Rashin, A., Willett, E.: An answer to a conjecture on overlaps in partial words using periodicity algorithms. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 188–199. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. 6.
    Blanchet-Sadri, F., Mercaş, R., Scott, G.: Counting distinct squares in partial words. In: Csuhaj-Varju, E., Esik, Z. (eds.) Proceedings of AFL, pp. 122–133 (2008)Google Scholar
  7. 7.
    Blanchet-Sadri, F., Schwartz, J., Stich, S.: Partial subword complexity (submitted 2010)Google Scholar
  8. 8.
    Diaconu, A., Manea, F., Tiseanu, C.: Combinatorial queries and updates on partial words. In: Gȩbala, M. (ed.) FCT 2009. LNCS, vol. 5699, pp. 96–108. Springer, Heidelberg (2009)Google Scholar
  9. 9.
    Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, New York (1979)zbMATHGoogle Scholar
  10. 10.
    Manea, F., Mercaş, R.: Freeness of partial words. Theoretical Computer Science 389(1-2), 265–277 (2007)zbMATHMathSciNetGoogle Scholar
  11. 11.
    Valiant, L.: The complexity of computing the permanent. Theoretical Computer Science 8, 189–201 (1979)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Florin Manea
    • 1
    • 2
  • Cătălin Tiseanu
    • 1
  1. 1.Faculty of Mathematics and Computer ScienceUniversity of BucharestBucharestRomania
  2. 2.Faculty of Computer ScienceOtto-von-Guericke-University Magdeburg, PSF 4120MagdeburgGermany

Personalised recommendations