On morphisms preserving infinite Lyndon words

被引:0
|
作者
Richmme, Gwenaeel [1 ]
机构
[1] Univ Picardie, LaRIA, F-80039 Amiens, France
关键词
combinatorics on words; morphisms; Lyndon words; infinite words; lexicographic order;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In a previous paper, we characterized free monoid morphisms preserving finite Lyndon words. In particular, we proved that such a morphism preserves the order on finite words. Here we study morphisms preserving in finite Lyndon words and morphisms preserving the order on in finite words. We characterize them and show relations with morphisms preserving Lyndon words or the order on finite words. We also briefly study morphisms preserving border-free words and those preserving the radix order.
引用
收藏
页码:89 / 107
页数:19
相关论文
共 50 条
  • [1] On morphisms preserving infinite Lyndon words
    Université de Picardie Jules Verne, LaRIA, 33 Rue Saint Leu, 80039 Amiens cedex 1, France
    [J]. Discrete Math. Theor. Comput. Sci., 2007, 2 (89-108):
  • [2] INFINITE LYNDON WORDS
    SIROMONEY, R
    MATHEW, L
    DARE, VR
    SUBRAMANIAN, KG
    [J]. INFORMATION PROCESSING LETTERS, 1994, 50 (02) : 101 - 104
  • [3] Infinite Smooth Lyndon Words
    Paquin, Genevieve
    [J]. PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2008, 2008, : 126 - 139
  • [4] A generator of morphisms for infinite words
    Ochem, Pascal
    [J]. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2006, 40 (03): : 427 - 441
  • [5] Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words
    Richomme, G.
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 380 (03) : 393 - 400
  • [6] Generalized Lyndon factorizations of infinite words
    Burcroff, Amanda
    Winsor, Eric
    [J]. THEORETICAL COMPUTER SCIENCE, 2020, 809 : 30 - 38
  • [7] A characterization of infinite smooth Lyndon words
    Paquin, Genevieve
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2010, 12 (05): : 25 - 62
  • [8] Generalized Lyndon Factorizations of Infinite Words
    Burcroff, Amanda
    Winsor, Eric
    [J]. COMBINATORICS ON WORDS, WORDS 2019, 2019, 11682 : 106 - 118
  • [9] ON INFINITE WORDS OBTAINED BY ITERATING MORPHISMS
    CULIK, K
    SALOMAA, A
    [J]. THEORETICAL COMPUTER SCIENCE, 1982, 19 (01) : 29 - 38
  • [10] INFINITE FIBONACCI WORDS AND ITERATED MORPHISMS
    PANSIOT, JJ
    [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1983, 17 (02): : 131 - 135