Applying a uniform marked morphism to a word
Abstract
We describe the relationship between different parameters of the initial word and its image obtained by application of a uniform marked morphism. The functions described include the subword complexity, frequency of factors, and the recurrence function. The relations obtained for the image of a word can be used also for the image of a factorial language. Using induction, we give a full description of the involved functions of the fixed point of the morphism considered.
Domains
Discrete Mathematics [cs.DM]
Origin : Files produced by the author(s)
Loading...