A limit theorem for sets of subwords in deterministic TOL languages
References (6)
The equivalence problem for deterministic TOL systems is undecidable
Inform. Proc. Letters
(1972)- et al.
Developmental systems and languages
Proc. IVth ACM Symp. on Theory of Comp.
(1972) - G. Rozenberg, TOL systems and languages, Information and Control, to...
There are more references available in the full text version of this article.
Cited by (11)
Another generalization of abelian equivalence: Binomial complexity of infinite words
2015, Theoretical Computer ScienceOn generalized DT0L systems and their fixed points
1994, Theoretical Computer ScienceOn the number of subwords of everywhere growing DTOL languages
1976, Discrete MathematicsSubword complexities of various classes of deterministic developmental languages without interactions
1975, Theoretical Computer ScienceDevelopmental algorithms for multicellular organisms: A survey of L-systems
1975, Journal of Theoretical BiologyComparing complexity functions of a language and its extendable part
2008, RAIRO - Theoretical Informatics and Applications
Copyright © 1973 Published by Elsevier B.V.