Name
Abstract | ||
|---|---|---|
The maximal pattern complexity function p*α (k) of an infinite word α = α0α1α2... over l letters, is introduced and studied by [3, 4].In the present paper we introduce two new techniques, the ascending chain of alphabets and the singular decomposition, to study the maximal pattern complexity. It is shown that if p*α(k) lk holds for some k ≥ 1, then α is periodic by projection. Accordingly we define a pattern Sturmian word over l letters to be a word which is not periodic by projection and has maximal pattern complexity function p*α(k) = lk. Two classes of pattern Sturmian words are given. This generalizes the definition and results of [3] where l = 2. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.ejc.2004.07.006 | Eur. J. Comb. |
Keywords | Field | DocType |
singular decomposition,infinite word,maximal pattern complexity function,maximal pattern complexity,l letter,present paper,pattern sturmian word,new technique,sturmian word | Discrete mathematics,Singular value decomposition,Combinatorics,Complexity function,Sturmian word,Periodic graph (geometry),Mathematics | Journal |
Volume | Issue | ISSN |
27 | 1 | 0195-6698 |
Citations | PageRank | References |
6 | 0.70 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Teturo Kamae | 1 | 25 | 5.20 |
| Rao Hui | 2 | 6 | 0.70 |