On critical exponents in fixed points of binary κ-uniform morphisms

被引:0
|
作者
Krieger, D [1 ]
机构
[1] Univ Waterloo, Sch Comp Sci, Waterloo, ON N2L 3G1, Canada
来源
STACS 2006, PROCEEDINGS | 2006年 / 3884卷
关键词
critical exponent; binary k-uniform morphism;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Let w be an infinite fixed point of a binary k-uniform morphism f, and let E(w) be the critical exponent of w. We give necessary and sufficient conditions for E(w) to be bounded, and an explicit formula to compute it when it is. In particular, we show that E(w) is always rational. We also sketch an extension of our method to non-uniform morphisms over general alphabets.
引用
收藏
页码:104 / 114
页数:11
相关论文
共 50 条
  • [1] ON CRITICAL EXPONENTS IN FIXED POINTS OF k-UNIFORM BINARY MORPHISMS
    Krieger, Dalia
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2009, 43 (01): : 41 - 68
  • [2] The subword complexity of fixed points of binary uniform morphisms
    Frid, AE
    FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 1997, 1279 : 179 - 187
  • [3] On critical exponents in fixed points of non-erasing morphisms
    Krieger, Dalia
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2006, 4036 : 280 - 291
  • [4] On critical exponents in fixed points of non-erasing morphisms
    Krieger, Dalia
    THEORETICAL COMPUTER SCIENCE, 2007, 376 (1-2) : 70 - 88
  • [5] Permutation complexity of the fixed points of some uniform binary morphisms
    Valyuzhenich, Alexander
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (63): : 257 - 264
  • [6] On permutation complexity of fixed points of some uniform binary morphisms
    Valyuzhenich, Alexandr
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2014, 16 (03): : 95 - 128
  • [7] ON PERMUTATION COMPLEXITY OF FIXED POINTS OF SOME NONUNIFORM BINARY MORPHISMS
    Valuzhenich, A. A.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2015, 12 : 64 - 79
  • [8] Synchronizing delay for binary uniform morphisms
    Klouda, Karel
    Medkova, Katerina
    THEORETICAL COMPUTER SCIENCE, 2016, 615 : 12 - 22
  • [9] On a conjecture about finite fixed points of morphisms
    Levé, F
    Richomme, G
    THEORETICAL COMPUTER SCIENCE, 2005, 339 (01) : 103 - 128
  • [10] Fixed points of Sturmian morphisms and their derivated words
    Klouda, Karel
    Medkova, Katerina
    Pelantova, Edita
    Starosta, Stepan
    THEORETICAL COMPUTER SCIENCE, 2018, 743 : 23 - 37