ON K-REPETITION FREE WORDS GENERATED BY LENGTH UNIFORM MORPHISMS OVER A BINARY ALPHABET

被引：0

|

作者：

KERANEN, V

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1985年 / 194卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：338 / 347

页数：10

相关论文

共 33 条

[1] ON K-REPETITION FREENESS OF LENGTH UNIFORM MORPHISMS OVER A BINARY ALPHABET
KERANEN, V
[J]. DISCRETE APPLIED MATHEMATICS, 1984, 9 (03) : 297 - 300
[2] ON CUBE-FREE OMEGA-WORDS GENERATED BY BINARY MORPHISMS
KARHUMAKI, J
[J]. DISCRETE APPLIED MATHEMATICS, 1983, 5 (03) : 279 - 297
[3] Existence of words over a binary alphabet free from squares with mismatches
Kotlyarov, Nikita, V
[J]. DISCRETE MATHEMATICS AND APPLICATIONS, 2019, 29 (03): : 175 - 188
[4] Length-k-overlap-free Binary Infinite Words
Seebold, Patrice
[J]. FUNDAMENTA INFORMATICAE, 2012, 116 (1-4) : 251 - 263
[5] Network Coding for K-Repetition in Grant-Free Random Access
Choi, Jinho
Ding, Jie
[J]. IEEE WIRELESS COMMUNICATIONS LETTERS, 2021, 10 (11) : 2557 - 2561
[6] There are k-uniform cubefree binary morphisms for all k ≥ 0
Currie, James
Rampersad, Narad
[J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (11) : 2548 - 2551
[7] Recognizing 3-collapsing words over a binary alphabet
Cherubini, Alessandra
Kisielewicz, Andrzej
[J]. THEORETICAL COMPUTER SCIENCE, 2016, 629 : 64 - 79
[8] On repetition-free binary words of minimal density
Fr.-Russ. Inst. Info. Appl. Math., Moscow University, 119899 Moscow, Russia
不详
不详
[J]. Theor Comput Sci, 1 (161-175):
[9] On repetition-free binary words of minimal density
Kolpakov, R
Kucherov, G
Tarannikov, Y
[J]. THEORETICAL COMPUTER SCIENCE, 1999, 218 (01) : 161 - 175
[10] On repetition-free binary words of minimal density
Kolpakov, R
Kucherov, G
Tarannikov, Y
[J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998, 1998, 1450 : 683 - 692

← 1 2 3 4 →