A limit theorem for sets of subwords in deterministic TOL languages
- 31 August 1973
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 2 (3), 70-73
- https://doi.org/10.1016/0020-0190(73)90003-3
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Dol sequencesDiscrete Mathematics, 1974
- TOL systems and languagesInformation and Control, 1973
- The equivalence problem for deterministic T0L-systems is undecidableInformation Processing Letters, 1972