A Characterization of Morphic Words with Polynomial Growth

被引：0
|
作者：
机构：
[1] Smith, Tim
来源：
Smith, Tim | 2020年 / Discrete Mathematics and Theoretical Computer Science卷 / 22期
关键词：
D O I：
10.23638/DMTCS-22-1-3
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] A Characterization of Morphic Words with Polynomial Growth
    Smith, Tim
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2020, 22 (01):
  • [2] On the Periodicity of Morphic Words
    Halava, Vesa
    Harju, Tero
    Karki, Tomi
    Rigo, Michel
    DEVELOPMENTS IN LANGUAGE THEORY, 2010, 6224 : 209 - +
  • [3] Periodicity of Morphic Words
    Mitrofanov I.V.
    Journal of Mathematical Sciences, 2015, 206 (6) : 679 - 687
  • [4] On the simplification of infinite morphic words
    Honkala, Juha
    Theoretical Computer Science, 2009, 410 (8-10) : 997 - 1000
  • [5] Morphic words and equidistributed sequences
    Andrieu, Melodie
    Frid, Anna E.
    THEORETICAL COMPUTER SCIENCE, 2020, 804 (804) : 171 - 185
  • [6] A REMARK ON MORPHIC STURMIAN WORDS
    BERSTEL, J
    SEEBOLD, P
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1994, 28 (3-4): : 255 - 263
  • [7] Extremal words in morphic subshifts
    Currie, James D.
    Rampersad, Narad
    Saari, Kalle
    Zamboni, Luca Q.
    DISCRETE MATHEMATICS, 2014, 322 : 53 - 60
  • [8] ALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDS
    Pelantova, Edita
    Starosta, Stepan
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (05) : 1067 - 1083
  • [9] On the subword equivalence problem for morphic words
    Fagnot, I
    DISCRETE APPLIED MATHEMATICS, 1997, 75 (03) : 231 - 253
  • [10] On the asymptotic abelian complexity of morphic words
    Blanchet-Sadri, F.
    Fox, Nathan
    Rampersad, Narad
    ADVANCES IN APPLIED MATHEMATICS, 2014, 61 : 46 - 84
12345