Skip to main content
SpringerLink
Log in

On subwords of formal languages

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1981)

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

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Ehrenfeucht and G. Rozenberg, A limit for sets of subwords in deterministic TOL systems, Information Processing Letters, 2 (1973), 70–73.

    Google Scholar 

  2. A. Ehrenfeucht, K.P. Lee and G. Rozenberg, Subword complexities of various classes of deterministic developmental languages without interactions, Theoretical Computer Science, 1 (1975), 59–76.

    Google Scholar 

  3. A. Ehrenfeucht and G. Rozenberg, On subword complexities of homomorphic images of languages, Rev. Fr. Automat. Inform. Rech. Opér., Ser. Rouge, to appear.

    Google Scholar 

  4. A. Ehrenfeucht and G. Rozenberg, On the subword complexity of square-free DOL Tanguages, Theoretical Computer Science, to appear.

    Google Scholar 

  5. A. Ehrenfeucht and G. Rozenberg, On the subword complexity of DOL languages with a constant distribution, Institute of Applied Mathematics and Computer Science, University of Leiden, The Netherlands, Technical Report No. 81-21, 1981.

    Google Scholar 

  6. K.P. Lee, Subwords of developmental languages, Ph.D. thesis, State University of New York at Buffalo, 1975.

    Google Scholar 

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

    Google Scholar 

  8. A. Thue, Uber unendliche Zeichenreihen, Norsk. Vid. Selsk. Skr. I Mat.-Nat.Kl. 7 (1906), 1–22.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Leiden, The Netherlands

    G. Rozenberg

Authors
  1. G. Rozenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rozenberg, G. (1981). On subwords of formal languages. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-10854-8_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38765-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation