Introducing privileged words: Privileged complexity of Sturmian words

被引：12
|
作者：
Peltomaki, Jarkko [1 ,2 ]
机构：
[1] Univ Turku, Dept Math & Stat, Turku 20014, Finland
[2] Turku Ctr Comp Sci TUCS, Turku 20520, Finland
来源：
THEORETICAL COMPUTER SCIENCE | 2013年 / 500卷
关键词：
Combinatorics on words; Sturmian words; Palindromes; Privileged words; Return words; Rich words; EPISTURMIAN WORDS;
D O I：
10.1016/j.tcs.2013.05.028
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we introduce a new class of so-called privileged words which have been previously considered only a little. We develop the basic properties of privileged words, which turn out to share similar properties with palindromes. Privileged words are studied in relation to previously studied classes of words, rich words, Sturmian words and episturmian words. A new characterization of Sturmian words is given in terms of privileged complexity. The privileged complexity of the Thue-Morse word is also briefly studied. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码：57 / 67
页数：11
相关论文
共 50 条
12345