On the subword complexity of DOL languages with a constant distribution
- 13 December 1981
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 13 (3) , 108-113
- https://doi.org/10.1016/0020-0190(81)90121-6
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- On the subword complexity of square-free DOL languagesTheoretical Computer Science, 1981