×

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


MSC:

68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Lindenmayer, A.; Rozenberg, G., Developmental systems and languages, Proc. IVth ACM Symp. on Theory of Comp. (1972), Denver, Colorado · Zbl 0353.68087
[2] G. Rozenberg, TOL systems and languages, Information and Control, to appear.; G. Rozenberg, TOL systems and languages, Information and Control, to appear. · Zbl 0273.68055
[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
[5] G. Rozenberg, Extension of tabled OL systems and languages, Internat. J. of Computer and Inform. Sc., to appear.; G. Rozenberg, Extension of tabled OL systems and languages, Internat. J. of Computer and Inform. Sc., to appear. · Zbl 0293.68065
[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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.