Skip to main content
SpringerLink
Log in

Periodic-Like Words

  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 2000 (MFCS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1893))

  • 497 Accesses

Abstract

We introduce the notion of periodic-like word. It is a word whose longest repeated prefix is not right special. Some different characterizations of this concept are given. We derive a new condition ensuring that the greatest common divisor of two periods of a word is a period, too. Then we characterize periodic-like words having the same set of proper boxes, in terms of the important notion of root-conjugacy. Finally, some new uniqueness conditions for words, related to the maximal box theorem are given.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Carpi, A., de Luca, A.: Words and Repeated Factors. Séminaire Lotharingien de Combinatoire B42l (1998) 24 pp.

    Google Scholar 

  2. Carpi, A., de Luca, A.:Words and Special Factors. Preprint 98/33, Dipartimento di Matematica dell’Universitá di Roma “La Sapienza” (1998), Theor. Comput. Sci. (to appear)

    Google Scholar 

  3. Carpi, A., de Luca, A.: Repetitions and Boxes in Words and Pictures. In: Karhumäki, J., Maurer, H., Pčaun, G., Rozenberg, G. (eds.): Jewels Are Forever, Springer-Verlag, Berlin (1999) 295–306

    Google Scholar 

  4. Carpi, A., de Luca, A.: Semiperiodic words and root-conjugacy. Preprint 10/2000, Dipartimento di Matematica dell’Universitá di Roma “La Sapienza” (2000)

    Google Scholar 

  5. de Luca, A.: On the Combinatorics of Finite Words. Theor. Comput. Sci. 218 (1999) 13–39

    Article  MATH  Google Scholar 

  6. Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading, MA (1983)

    MATH  Google Scholar 

  7. Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Cibernetica del CNR, via Toiano 6, 80072, Arco Felice(NA), Italy

    Arturo Carpi

  2. Dipartimento di Matematica dell’Universitá di Roma ‘La Sapienza’, piazzale Aldo Moro 2, 00185, Roma, Italy

    Aldo de Luca

Authors
  1. Arturo Carpi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aldo de Luca
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Aarhus, Ny Munkegade, Bldg. 540, 8000, Aarhus C, Denmark

    Mogens Nielsen

  2. Department of Computer Sciene, Comenius University, 84248, Bratislava, Slovakia

    Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carpi, A., de Luca, A. (2000). Periodic-Like Words. In: Nielsen, M., Rovan, B. (eds) Mathematical Foundations of Computer Science 2000. MFCS 2000. Lecture Notes in Computer Science, vol 1893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44612-5_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-44612-5_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67901-1

  • Online ISBN: 978-3-540-44612-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation