On k-repetition freeness of length uniform morphisms over a binary alphabet (Q799123): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On cube-free \(\omega\)-words generated by binary morphisms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4140407 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3948608 / rank | |||
Normal rank | |||
Latest revision as of 14:03, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On k-repetition freeness of length uniform morphisms over a binary alphabet |
scientific article |
Statements
On k-repetition freeness of length uniform morphisms over a binary alphabet (English)
0 references
1984
0 references
repetition free word
0 references
length uniform morphism
0 references
DOL sequence
0 references
