On subword complexities of homomorphic images of languages
- 1 January 1982
- journal article
- Published by EDP Sciences in RAIRO. Informatique théorique
- Vol. 16 (4) , 303-316
- https://doi.org/10.1051/ita/1982160403031
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- Subword complexities of various classes of deterministic developmental languages without interactionsTheoretical Computer Science, 1975
- A limit theorem for sets of subwords in deterministic TOL languagesInformation Processing Letters, 1973