On the subword complexity of m-free D0L languages
- 5 October 1983
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 17 (3) , 121-124
- https://doi.org/10.1016/0020-0190(83)90050-9
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On the subword complexity of square-free DOL languagesTheoretical Computer Science, 1981
- On the subword complexity of DOL languages with a constant distributionInformation Processing Letters, 1981