Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
Author:
- 11 May 2012
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 432, 85-93
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Criteria for the matrix equivalence of wordsTheoretical Computer Science, 2010
- SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGESInternational Journal of Foundations of Computer Science, 2010
- COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCESInternational Journal of Foundations of Computer Science, 2007
- On fairness of D0L systemsDiscrete Applied Mathematics, 2007
- Subword histories and Parikh matricesJournal of Computer and System Sciences, 2004
- Extending Parikh matricesTheoretical Computer Science, 2004
- A sharpening of the Parikh mappingRAIRO - Theoretical Informatics and Applications, 2001
- The generating function of the number of subpatterns of a DOL sequenceTheoretical Computer Science, 1979
- Sur les series associees a certains systemes de lindenmayerTheoretical Computer Science, 1979
- Book Review: Automata-theoretic aspects of formal power seriesBulletin of the American Mathematical Society, 1979