2008/11/13 by Petr Ambrož, Zuzana Masáková, Ambrož, Petr +3
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #08A50 #68R15 #Algorithms and Data Compression #Combinatorics (math.CO) #DNA and Biological Computing #FOS: Mathematics #math.CO #msc:08A50 #msc:68R15 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.0811.2147
13 pages, 5 figures
arxiv created 2008/11/13 · openalex publication_date 2008/11/13 · arxiv updated 2009/12/01 · openalex created_date 2019/06/27 · openalex updated_date 2026/07/31
We consider words coding exchange of three intervals with permutation (3,2,1), here called 3iet words. Recently, a characterization of substitution invariant 3iet words was provided. We study the opposite question: what are the morphisms fixing a 3iet word? We reveal a narrow connection of such morphisms and morphisms fixing Sturmian words using the new notion of amicability.