Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphismes iteres
- 1 January 1984
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 230-240
- https://doi.org/10.1007/3-540-12920-0_21
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Hiérarchie et fermeture de certaines classes de tag-systèmesActa Informatica, 1983
- On the subword complexity of m-free D0L languagesInformation Processing Letters, 1983
- On the subword complexity of locally catenative dol languagesInformation Processing Letters, 1983
- On subword complexities of homomorphic images of languagesRAIRO. Informatique théorique, 1982
- 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
- On subwords of formal languagesPublished by Springer Nature ,1981
- Automata-Theoretic Aspects of Formal Power SeriesPublished by Springer Nature ,1978
- Subword complexities of various classes of deterministic developmental languages without interactionsTheoretical Computer Science, 1975