A limit theorem for sets of subwords in deterministic TOL languages

https://doi.org/10.1016/0020-0190(73)90003-3Get rights and content

First page preview

First page preview
Click to open first page preview

References (6)

There are more references available in the full text version of this article.

Cited by (11)

  • On generalized DT0L systems and their fixed points

    1994, Theoretical Computer Science
  • Comparing complexity functions of a language and its extendable part

    2008, RAIRO - Theoretical Informatics and Applications
View all citing articles on Scopus
View full text