A characterization of the words occurring as factors in a minimum number of words

被引：0
|
作者：
Tomescu, I [1 ]
机构：
[1] Univ Bucharest, Fac Math & Comp Sci, Bucharest 010014, Romania
来源：
THEORETICAL COMPUTER SCIENCE | 2006年 / 352卷 / 1-3期
关键词：
word; factor; injective proof; autocorrelation polynomial;
D O I：
10.1016/j.tcs.2005.11.042
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show by an injective proof that a word w of length k >= 2 occurs as a factor in a minimum number of words of length n (n > k) if and only if all letters of w are equal. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：329 / 331
页数：3
相关论文
共 50 条
12345