On correlation polynomials and subword complexity (Q3576750)
From MaRDI portal
!
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 5763304
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On correlation polynomials and subword complexity |
scientific article; zbMATH DE number 5763304 |
Statements
2 August 2010
0 references
analytic methods
0 references
asymptotics
0 references
autocorrelation
0 references
average-case analysis
0 references
combinatorics on words
0 references
correlation polynomial
0 references
de Bruijn graph
0 references
depth
0 references
subword complexity
0 references
suffix trees
0 references
0.7534592747688293
0 references
