Some properties of substitutive words
type: Item
instance of: scholarly article
title: Some properties of substitutive words
zbMATH Open document ID: 1071.68086
author: Julien Cassaigne
author: François Nicolas
published in: Bulletin of the Belgian Mathematical Society - Simon Stevin
publication date: 2005-06-09T00:00:00Z
full work available at URL: https://projecteuclid.org/euclid.bbms/1074791324
review text: The authors are interested in substitutive words (i.e., words obtained by applying a morphism of the free monoid to the iterative fixed point of some morphism of the free monoid). Cobham proved in 1968 that such a word can be obtained by a more precise construction where the first morphism above is a letter-to-letter morphism. The authors give a simpler proof of Cobham's result. They also obtain refined results for purely substitutive words and for the block-complexity of substitutive words. Please note that Reference [1] appeared: [\textit{J.-P. Allouche} and \textit{J. Shallit}, Automatic sequences. Theory, applications, generalizations. Cambridge: University Press (2003; Zbl 1086.11015)].
reviewed by: Jean-Paul Allouche
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 11B85
zbMATH DE Number: 2174587
zbMATH Keywords: combinatorics on words
zbMATH Keywords: substitutive words
zbMATH Keywords: morphic words
zbMATH Keywords: subword complexity
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 2174587