Some properties of morphic images of (eventually) dendric words

08/31/2022
by   France Gheeraert, et al.
0

The class of (eventually) dendric words generalizes well-known families such as the Arnoux-Rauzy words or the codings of interval exchanges. There are still many open questions about the link between dendricity and morphisms. In this paper, we focus on two questions. The first one is the evolution of the factor complexity when applying a non-erasing morphism to an eventually dendric word. We next look at the morphisms that preserve dendricity for all dendric words and show that they are exactly those generated by the Arnoux-Rauzy morphisms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/12/2022

Binomial Complexities and Parikh-Collinear Morphisms

Two words are k-binomially equivalent, if each word of length at most k ...
research
06/22/2020

On morphisms preserving palindromic richness

Droubay, Justin and Pirillo that each word of length n contains at most ...
research
06/07/2022

Fibonacci-like sequences for variants of the tower of Hanoi, and corresponding graphs and gray codes

We modify the rules of the classical Tower of Hanoi puzzle in a quite na...
research
11/16/2020

On sets of indefinitely desubstitutable words

The stable set associated to a given set S of nonerasing endomorphisms o...
research
10/17/2018

Balancedness and coboundaries in symbolic systems

This paper studies balancedness for infinite words and subshifts, both f...
research
06/02/2022

On the Lie complexity of Sturmian words

Bell and Shallit recently introduced the Lie complexity of an infinite w...
research
03/12/2020

It Means More if It Sounds Good: Yet Another Hypotheses Concerning the Evolution of Polysemous Words

This position paper looks into the formation of language and shows ties ...

Please sign up or login with your details

Forgot password? Click here to reset