Square-free partial words

被引：11
|
作者：
Halava, Vesa
Harju, Tero
Karki, Tomi [1 ]
机构：
[1] Univ Turku, Dept Math, Turku 20014, Finland
来源：
INFORMATION PROCESSING LETTERS | 2008年 / 108卷 / 05期
关键词：
Combinatorial problems; Partial word; Square-free; Thue-Morse word; Leech word;
D O I：
10.1016/j.ipl.2008.06.001
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We say that a partial word w over an alphabet A is square-free if every factor xx' of w such that x and x' are compatible is either of the form lozenge a or a lozenge where lozenge is a hole and a is an element of A. We prove that there exist uncountably many square-free partial words over a ternary alphabet with an infinite number of holes. (c) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：290 / 292
页数：3
相关论文
共 50 条
12345