Avoidability index for binary patterns with reversal (Q252854)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6549745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Avoidability index for binary patterns with reversal |
scientific article; zbMATH DE number 6549745 |
Statements
Avoidability index for binary patterns with reversal (English)
0 references
4 March 2016
0 references
Summary: For every pattern \(p\) over the alphabet \(\{x,x^R,y, y^R\}\), we specify the least \(k\) such that \(p\) is \(k\)-avoidable.
0 references
combinatorics on words
0 references
words avoiding patterns
0 references
reversals
0 references
0 references
