A combinatorial problem on trapezoidal words. (Q1605325): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sturmian words, Lyndon words and trees / 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: On the combinatorics of finite words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Uniqueness Theorems for Periodic Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3659988 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4529547 / rank | |||
Normal rank |
Latest revision as of 10:55, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A combinatorial problem on trapezoidal words. |
scientific article |
Statements
A combinatorial problem on trapezoidal words. (English)
0 references
15 July 2002
0 references
Special factors
0 references
Subword complexity
0 references
Sturmian words
0 references