Applying a uniform marked morphism to a word
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...
Main Author: | Anna Frid |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
1999-12-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/102 |
Similar Items
-
Unambiguous 1-Uniform Morphisms
by: Hossein Nevisi, et al.
Published: (2011-08-01) -
On morphisms preserving infinite Lyndon words
by: Gwénaël Richomme
Published: (2007-05-01) -
Permutation complexity of the fixed points of some uniform binary morphisms
by: Alexander Valyuzhenich
Published: (2011-08-01) -
Morphisms.
by: Crowe, Samuel W
Published: (2010) -
Morphisms of Fusion Systems
by: Amundsson, Karl
Published: (2014)