On infinite words obtained by iterating morphisms
- 31 July 1982
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 19 (1) , 29-38
- https://doi.org/10.1016/0304-3975(82)90013-5
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The ultimate equivalence problem for DOL systemsActa Informatica, 1978
- The decidability of the equivalence problem for DOL-systemsInformation and Control, 1977
- The decidability of the dol prefix problemInternational Journal of Computer Mathematics, 1977