Upper Bound for Palindromic and Factor Complexity of Rich Words (Q6307893)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Upper Bound for Palindromic and Factor Complexity of Rich Words |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper Bound for Palindromic and Factor Complexity of Rich Words |
scientific article |
Statements
8 October 2018
0 references
math.CO
0 references
