Shurmian morphisms and α-words

被引:0
|
作者
Chuan, WF [1 ]
机构
[1] Chung Yuan Christian Univ, Dept Math, Chungli 32023, Taiwan
关键词
alpha-word; Sturmian morphism; Sturmian word;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper we prove that the set W of alpha-words over {0, 1} coincides with the set of images of 0 under Sturmian morphisms. This gives an alternative approach of generating alpha-words. For each w is an element of W, a Sturmian solution H of the equation w = H(0) which is a composition of Sturmian morphisms of special forms can be constucted explicitly. In order to demonstrate how results on Sturmian morphic images are reformulated as results on alpha-words and vice versa, we give a Sturmian proof for the conjugation and reversion theorem of alpha-words obtained by the present author in an earlier paper. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:129 / 148
页数:20
相关论文
共 50 条
  • [1] Words and morphisms with Sturmian erasures
    Durand, F
    Guerziz, A
    Koskas, M
    BULLETIN OF THE BELGIAN MATHEMATICAL SOCIETY-SIMON STEVIN, 2004, 11 (04) : 575 - 588
  • [2] A generator of morphisms for infinite words
    Ochem, Pascal
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2006, 40 (03): : 427 - 441
  • [3] Quasiperiodic Sturmian words and morphisms
    Leve, F.
    Richomme, G.
    THEORETICAL COMPUTER SCIENCE, 2007, 372 (01) : 15 - 25
  • [4] Morphisms generating antipalindromic words
    Ambroz, Petr
    Masakova, Zuzana
    Pelantova, Edita
    EUROPEAN JOURNAL OF COMBINATORICS, 2020, 89
  • [5] NONREPETITIVE WORDS AND ITERATED MORPHISMS
    BERSTEL, J
    DISCRETE MATHEMATICS, 1980, 29 (03) : 235 - 244
  • [6] Episturmian words and episturmian morphisms
    Justin, J
    Pirillo, G
    THEORETICAL COMPUTER SCIENCE, 2002, 276 (1-2) : 281 - 313
  • [7] FIBONACCI MORPHISMS AND STURMIAN WORDS
    SEEBOLD, P
    THEORETICAL COMPUTER SCIENCE, 1991, 88 (02) : 365 - 384
  • [8] Characteristic morphisms of generalized episturmian words
    Bucci, Michelangelo
    de Luca, Aldo
    De Luca, Alessandro
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (30-32) : 2840 - 2859
  • [9] On morphisms preserving infinite Lyndon words
    Université de Picardie Jules Verne, LaRIA, 33 Rue Saint Leu, 80039 Amiens cedex 1, France
    Discrete Math. Theor. Comput. Sci., 2007, 2 (89-108):
  • [10] ON INFINITE WORDS OBTAINED BY ITERATING MORPHISMS
    CULIK, K
    SALOMAA, A
    THEORETICAL COMPUTER SCIENCE, 1982, 19 (01) : 29 - 38