Skip to main content
SpringerLink
Log in

Repetitions in homomorphisms and languages

  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 1982)

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

Included in the following conference series:

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. J. Berstel, Sur les mots sans carré définis par un morphisme, 1979, Springer Lecture Notes in Computer Science, v71, 16–25.

    Article  Google Scholar 

  2. D.R. Bean, A. Ehrenfeucht and G.F. Mc Nulty, Avoidable patterns in strings of symbols, 1979, Pacific Journal of Mathematics, v85, no.2, 261–293.

    Article  MathSciNet  Google Scholar 

  3. A. Cobham, Uniform tag sequences, Mathematical Systems Theory, 1972, v.6, n.2, 164–191.

    Article  MathSciNet  Google Scholar 

  4. F.M. Dekking, Combinatorial and statistical properties of sequences generated by substitutions, 1980, Ph.D. Thesis, University of Nijmegen, Holland.

    Google Scholar 

  5. M. Harrison, Introduction to formal language theory, 1978, Addison-Wesley, Reading, Massachussetts.

    MATH  Google Scholar 

  6. J. Karhumaki, On cubic-free Ω-words generated by binary morphisms, 1981 to appear.

    Google Scholar 

  7. M. Morse and G. Hedlund, Unending chess, symbolic dynamics and a problem of semigroups, 1944, Duke Math. Journal, v.11, 1–7.

    Article  MathSciNet  Google Scholar 

  8. P.A. Pleasants, Non-repetitive sequences, 1970, Proc. Cambridge Phil. Society, v.68, 267–274.

    Article  MathSciNet  Google Scholar 

  9. G. Rozenberg and A. Salomaa, The mathematical theory of L systems, 1980, Academic Press, London, New York.

    MATH  Google Scholar 

  10. A. Salomaa, Morphisms on free monoids and language theory, in R.V. Book, ed., Formal language theory, perspectives and open problems, 1980, Academic Press, London, New York, 141–166.

    Chapter  Google Scholar 

  11. A. Salomaa, Jewels of formal language theory, Computer Science Press, 1981.

    Google Scholar 

  12. A. Thue, Uber unendliche Zeichenreihen, 1906, Norske Vid. Selsk. Skr., I Mat. Nat. Kl., Christiania, v.7, 1–22.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Colorado at Boulder, 80309, Boulder, Colorado, USA

    A. Ehrenfeucht

  2. Institute of Applied Mathematics and Computer Science, University of Leiden, Leiden, The Netherlands

    G. Rozenberg

Authors
  1. A. Ehrenfeucht
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Rozenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ehrenfeucht, A., Rozenberg, G. (1982). Repetitions in homomorphisms and languages. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012769

Download citation

  • DOI: https://doi.org/10.1007/BFb0012769

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11576-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation