Overlap-free words

被引：0
|
作者：
机构：
来源：
Lecture Notes in Control and Information Sciences | 2009年 / 385卷
关键词：
D O I：
10.1007/978-3-540-95980-9_8
中图分类号：
学科分类号：
摘要：
4
引用
收藏
页码：101 / 114
相关论文
共 50 条
  • [1] Overlap-free words and spectra of matrices
    Jungers, Raphael M.
    Protasov, Vladimir Y.
    Blondel, Vincent D.
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3670 - 3684
  • [2] OVERLAP-FREE WORDS AND FINITE AUTOMATA
    CARPI, A
    THEORETICAL COMPUTER SCIENCE, 1993, 115 (02) : 243 - 260
  • [3] Extremal overlap-free and extremal β-free binary words
    Mol, Lucas
    Rampersad, Narad
    Shallit, Jeffrey
    ELECTRONIC JOURNAL OF COMBINATORICS, 2020, 27 (04): : 1 - 15
  • [4] Computing the growth of the number of overlap-free words with spectra of matrices
    Jungers, Raphael M.
    Protasov, Vladimir Yu.
    Blondel, Vincent D.
    LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 84 - +
  • [5] OVERLAP-FREE SEQUENCES
    SEEBOLD, P
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 192 : 207 - 215
  • [6] Nondeterministic automatic complexity of overlap-free and almost square-free words
    Hyde, Kayleigh K.
    Kjos-Hanssen, Bjorn
    ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (03):
  • [7] The first-order theory of binary overlap-free words is decidable
    Schaeffer, Luke
    Shallit, Jeffrey
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 2024, 76 (04): : 1144 - 1162
  • [8] Deciding context equivalence of binary overlap-free words in linear time
    Shur, Arseny M.
    SEMIGROUP FORUM, 2012, 84 (03) : 447 - 471
  • [9] Deciding context equivalence of binary overlap-free words in linear time
    Arseny M. Shur
    Semigroup Forum, 2012, 84 : 447 - 471
  • [10] A CHARACTERIZATION OF OVERLAP-FREE MORPHISMS
    BERSTEL, J
    SEEBOLD, P
    DISCRETE APPLIED MATHEMATICS, 1993, 46 (03) : 275 - 281
12345