On the subword complexity of square-free DOL languages
- 31 December 1981
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 16 (1), 25-32
- https://doi.org/10.1016/0304-3975(81)90028-1
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Mots sans carre et morphismes iteresDiscrete Mathematics, 1980
- On the structure of polynomially bounded DOL systemsFundamenta Informaticae, 1979
- Subword complexities of various classes of deterministic developmental languages without interactionsTheoretical Computer Science, 1975
- Classification of noncounting eventsJournal of Computer and System Sciences, 1971