AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY (Q3016224): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1005.2514 / rank | |||
Normal rank | |||
Revision as of 11:03, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY |
scientific article |
Statements
AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY (English)
0 references
14 July 2011
0 references
avoidability in words
0 references
abelian power
0 references
abelian complexity
0 references
