Advertisement

On subwords of formal languages

  • G. Rozenberg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 117)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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. 4.
    A. Ehrenfeucht and G. Rozenberg, On the subword complexity of square-free DOL Tanguages, Theoretical Computer Science, to appear.Google Scholar
  5. 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. 6.
    K.P. Lee, Subwords of developmental languages, Ph.D. thesis, State University of New York at Buffalo, 1975.Google Scholar
  7. 7.
    G. Rozenberg and A. Salomaa, The mathematical theory of L Systems, Academic Press, London, New York, 1980.Google Scholar
  8. 8.
    A. Thue, Uber unendliche Zeichenreihen, Norsk. Vid. Selsk. Skr. I Mat.-Nat.Kl. 7 (1906), 1–22.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • G. Rozenberg
    • 1
  1. 1.University of LeidenThe Netherlands

Personalised recommendations