A limit theorem for set of subwords in deterministic TOL laguages. (English) Zbl 0299.68044


68Q45 Formal languages and automata
Full Text: DOI


[1] Lindenmayer, A.; Rozenberg, G., Developmental systems and languages, Proc. IVth ACM Symp. on Theory of Comp. (1972), Denver, Colorado · Zbl 0353.68087
[3] Rozenberg, G., The equivalence problem for deterministic TOL systems is undecidable, Inform. Proc. Letters, 1, 201 (1972) · Zbl 0267.68033
[4] Rozenberg, G., DOL sequences, Discrete Math., 7 (1974), to appear · Zbl 0287.68052
[6] Salomaa, A., Formal Languages (1973), Academic Press · Zbl 0262.68025
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.