Fixed points of Sturmian morphisms and their derivated words

@article{Klouda2018FixedPO,
title={Fixed points of Sturmian morphisms and their derivated words},
author={K. Klouda and K. Medkov{\'a} and E. Pelantov{\'a} and Step{\'a}n Starosta},
journal={Theor. Comput. Sci.},
year={2018},
volume={743},
pages={23-37}
}
• K. Klouda, +1 author Stepán Starosta
• Published 2018
• Mathematics, Computer Science
• Theor. Comput. Sci.
• Any infinite uniformly recurrent word ${\bf u}$ can be written as concatenation of a finite number of return words to a chosen prefix $w$ of ${\bf u}$. Ordering of the return words to $w$ in this concatenation is coded by derivated word $d_{\bf u}(w)$. In 1998, Durand proved that a fixed point ${\bf u}$ of a primitive morphism has only finitely many derivated words $d_{\bf u}(w)$ and each derivated word $d_{\bf u}(w)$ is fixed by a primitive morphism as well. In our article we focus on Sturmian… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 25 REFERENCES
Acyclic, connected and tree sets
38
Descendants of Primitive Substitutions
• Mathematics, Computer Science
• 1999
42
Equations Enforcing Repetitions Under Permutations
• Computer Science, Mathematics
• 2017
4
Words derivated from Sturmian words
• Mathematics, Computer Science
• 2005
12
Sequences with constant number of return words
• Mathematics, Computer Science
• 2006
40
Episturmian words: a survey
• Computer Science, Mathematics
• 2009
83
On a Family of Morphic Images of Arnoux-Rauzy Words
• Mathematics, Computer Science
• 2009
8