Advertisement

Subword complexities of various classes of deterministic developmental languages with interactions

  • A. Ehrenfeucht
  • K. P. Lee
  • G. Rozenberg
Article
  • 33 Downloads

Abstract

Lee has shown that ifL is aDOL language, then πink(L) <C · k2 for some constantC, where πink(L) denotes the number of subwords of lengthk inL. We show that the result does not hold forDIL languages. It is also shown that each everywhere growing (uniform)DIL language is the image under a coding of an everywhere growing (uniform)DOL language. A similar result holds for languages generated by systems with tables. These enable us to solve the subword complexity problems for developmental languages with interactions.

Key words

Developmental languages with interactions subwords subword complexity deterministic systems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. Van Dalen, “A note on some systems of Lindenmayer,”Math. Systems Theory 5:128–140 (1971).Google Scholar
  2. 2.
    P. Doucet, “On the membership question in some Lindenmayer systems,”Indagationes Mathematicae 34:45–52 (1972).Google Scholar
  3. 3.
    A. Ehrenfeucht and G. Rozenberg, “A limit theorem for sets of sub words in deterministic TOL systems,”Information and Control 2:70–73 (1973).Google Scholar
  4. 4.
    G. T. Herman and G. Rozenberg, Developmental Systems and Languages (North-Holland Publishing Co., Amsterdam, to be published).Google Scholar
  5. 5.
    K. P. Lee, “Subwords of developmental languages,” Ph.D. dissertation, State University of New York at Buffalo, 1975.Google Scholar
  6. 6.
    A. Lindenmayer, “Mathematical models for cellular interactions in development, Parts I and II,” /.Theoret. Biol. 8:280–315 (1968).Google Scholar
  7. 7.
    A. Lindenmayer, “Developmental systems without cellular interactions, their languages and grammars,”J. Theoret. Biol. 30:455–484 (1971).Google Scholar
  8. 8.
    A. Lindenmayer and G. Rozenberg, “Developmental systems and languages,” inProc. 4th ACM Symp. on Theory of Computing (1972), pp. 214–221.Google Scholar
  9. 9.
    A. Paz and A. Salomaa, “Integral sequential word functions and growth equivalence of Lindenmayer systems,”Information and Control 23:313–343 (1973).Google Scholar
  10. 10.
    G. Rozenberg, “DOL sequences,”Discrete Mathematics 7:323–347 (1974).Google Scholar
  11. 11.
    G. Rozenberg and A. Lindenmayer, “Developmental systems with locally catenative formulas,”Acta Informatica 2:214–248 (1973).Google Scholar
  12. 12.
    A. Salomaa, “On exponential growth in Lindenmayer systems,”Indagationes Mathematicae 35:23–30 (1973).Google Scholar
  13. 13.
    A. Salomaa, “On some recent problems concerning developmental languages,” to appear inProc. Conf. on Automata and Formal Languages.Google Scholar

Copyright information

© Plenum Publishing Corporation 1975

Authors and Affiliations

  • A. Ehrenfeucht
    • 1
  • K. P. Lee
    • 2
  • G. Rozenberg
    • 3
    • 4
  1. 1.Department of Computer ScienceUniversity of ColoradoBoulder
  2. 2.Department of Computer ScienceSUNY at BuffaloAmherst
  3. 3.Institute of MathematicsUniversity of UtrechtUtrecht-De UithofThe Netherlands
  4. 4.Department of MathematicsUniversity of Antwerp, UIABelgium

Personalised recommendations