Skip to main content
SpringerLink
Log in

Discovering Hidden Repetitions in Words

  • Conference paper
The Nature of Computation. Logic, Algorithms, Applications (CiE 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7921))

Included in the following conference series:

Abstract

Pseudo-repetitions are a natural generalization of the classical notion of repetitions in sequences: they are the repeated concatenation of a word and its encoding under a certain morphism or antimorphism. We approach the problem of deciding whether there exists an anti-/morphism for which a word is a pseudo-repetition. In other words, we try to discover whether a word has a hidden repetitive structure. We show that some variants of this problem are efficiently solvable, while some others are NP-complete.

P. Gawrychowski is supported by the NCN grant 2011/01/D/ST6/07164, F. Manea by the DFG grant 596676, D. Nowotka by the DFG Heisenberg grant 590179.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Czeizler, E., Kari, L., Seki, S.: On a special class of primitive words. Theoretical Computer Science 411, 617–630 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  2. Manea, F., Mercaş, R., Nowotka, D.: Fine and Wilf’s theorem and pseudo-repetitions. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 668–680. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  3. Manea, F., Müller, M., Nowotka, D.: The avoidability of cubes under permutations. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 416–427. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Gawrychowski, P., Manea, F., Mercaş, R., Nowotka, D., Tiseanu, C.: Finding pseudo-repetitions. In: Proc. STACS (to appear, 2013)

    Google Scholar 

  5. Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on strings. Cambridge University Press (2007)

    Google Scholar 

  6. Kärkkäinen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM 53, 918–936 (2006)

    Article  MathSciNet  Google Scholar 

  7. Fine, N.J., Wilf, H.S.: Uniqueness theorem for periodic functions. Proceedings of the American Mathematical Society 16, 109–114 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York (1997)

    Book  MATH  Google Scholar 

  9. Ehrenfeucht, A., Rozenberg, G.: Finding a Homomorphism Between Two Words is NP-Complete. Inf. Process. Lett. 9(2), 86–88 (1979)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Saarbrücken, Germany

    Paweł Gawrychowski

  2. Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Kiel, Germany

    Florin Manea & Dirk Nowotka

Authors
  1. Paweł Gawrychowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Florin Manea
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dirk Nowotka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento die Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Piazza dell’Ateneo Nuovo 1, 20126, Milan, Italy

    Paola Bonizzoni

  2. Institute for Theoretical Computer Science, Mathematics and Operations Research, Faculty of Computer Science, Universität der Bundeswehr München, Werner-Heisenberg-Weg 39, 85577, Neubiberg, Germany

    Vasco Brattka

  3. Institute for Logic, Language and Computation, University of Amsterdam, Postbus 94242, 1090 GE, Amsterdam, The Netherlands

    Benedikt Löwe

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gawrychowski, P., Manea, F., Nowotka, D. (2013). Discovering Hidden Repetitions in Words. In: Bonizzoni, P., Brattka, V., Löwe, B. (eds) The Nature of Computation. Logic, Algorithms, Applications. CiE 2013. Lecture Notes in Computer Science, vol 7921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39053-1_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39053-1_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39052-4

  • Online ISBN: 978-3-642-39053-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation