Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
434464 | Theoretical Computer Science | 2013 | 11 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics