Combinatorial properties of smooth infinite words (Q818144): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: Srečko Brlek / rank | |||
Property / author | |||
Property / author: Dulucq, Serge / rank | |||
Property / author | |||
Property / author: Srečko Brlek / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Dulucq, Serge / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.12.003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2155195622 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Enumeration of factors in the Thue-Morse word / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on differentiable palindromes. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4431344 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On repeated factors in \(C^\infty\)-words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3879325 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3926698 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4356052 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Palindromes and Sturmian words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Introduction to Symbolic Dynamics and Coding / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4529547 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sturmian words: structure, combinatorics, and their arithmetics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4431371 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of \(C^{\infty}\)-words of each length / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:28, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Combinatorial properties of smooth infinite words |
scientific article |
Statements
Combinatorial properties of smooth infinite words (English)
0 references
24 March 2006
0 references
Any nonempty word \(w\) over \(\Sigma = \{1,2\}\) can be viewed as a sequence of alternating blocks of \(1\)'s and \(2\)'s. The run-length encoding \(\Delta\) gives the size of the blocks appearing in \(w\), and can be extended easily to infinite words. In this very interesting and well written paper, the authors restrict themselves to words not having \(111\) or \(222\) as factors and define the class of all infinite \textit{smooth} words. More precisely, since the operator \(\Delta\) can be iterated, an infinite word \(W\) over \(\Sigma\) is called smooth if for all nonnegative integers \(k\), we have that \(\Delta^k(W)\) is an infinite word over \(\Sigma\). It turns out that the operator \(\Delta\) has two fixpoints, \(K\) and \(1 \cdot K\), where \(K\) denotes the so-called Kolakoski word which has attracted considerable attention due to some intriguing combinatorial properties. The authors study regularities such as palindromes, squares, and overlaps in smooth words. They also investigate the question whether there exist smooth words, besides \(K\), that can be obtained as fixpoints of substitutions.
0 references
combinatorics
0 references
smooth words
0 references
Kolakoski word
0 references
substitutions
0 references
fixed points
0 references