Skip to main content
SpringerLink
Log in

Some Decision Results on Nonrepetitive Words

  • Conference paper
Combinatorial Algorithms on Words

Part of the book series: NATO ASI Series ((NATO ASI F,volume 12))

Abstract

The paper addresses some generalizations of the Thue Problem such as: given a word u, does there exist an infinite nonrepetitive overlap free (or square free) word having u as a prefix? A solution to this as well as to related problems is given for the case of overlap free words on a binary alphabet.

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. F.J. BRANDENBURG, Uniformly growing k-th power free homomorphism, Theoretical Computer Science, 23 (1983) 69–82.

    Article  MathSciNet  MATH  Google Scholar 

  2. A. CARPI, A result on weakly square free words related to a problem of Restivo, Bulletin of the EATCS, 22 (1984) 116–119.

    Google Scholar 

  3. A. deLuca, A. RESTIVO, S. SALEMI, On the centers of a language, Theoretical Computer Science, 24 (1983) 21–34.

    Article  MathSciNet  Google Scholar 

  4. M. LOTHAIRE, Combinatorics on words, Addison-Wesley (1983).

    Google Scholar 

  5. M. NIVAT, Sur les ensembles de mots infinis engendres par une grammaire algebrique, RAIRO J. Theoretical Informatics 12 (1980) 259–278.

    MathSciNet  Google Scholar 

  6. A. RESTIVO, S. SALEMI, On weakly square free words, Bulletin of the EATCS, 21 (1983) 49–56.

    Google Scholar 

  7. R. SHELTON, R. SONI, Aperiodic words on three symbols, III, J. reine angew Math., 330 (1982) 44–52.

    MathSciNet  MATH  Google Scholar 

  8. A. THUE, Uber unendliche Zeichernreihen, Norske Vid. Selsk. Skr. I, Mat. Nat. KI. Christiana 7 (1906) 1–22.

    Google Scholar 

  9. A. THUE, Uber die gegenseitie Lage gleicher Teile gewisser Zeichernreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. KI. Christiana 1 (1912) 1–67.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Matematica, dell’Universitá di Palermo, Via Archirafi 34, Palermo, Italy

    Antonio Restivo & Sergio Salemi

Authors
  1. Antonio Restivo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergio Salemi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Sciences, Mathematical Sciences Building, 47906, West Lafayette, IN, USA

    Alberto Apostolico

  2. Department of Computer Science, Columbia University, 10027, New York, NY, USA

    Zvi Galil

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Restivo, A., Salemi, S. (1985). Some Decision Results on Nonrepetitive Words. In: Apostolico, A., Galil, Z. (eds) Combinatorial Algorithms on Words. NATO ASI Series, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82456-2_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-82456-2_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-82458-6

  • Online ISBN: 978-3-642-82456-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation