Corpus ID: 6937017

Maximal Complexity of Finite Words

@article{Anisiu2010MaximalCO,
  title={Maximal Complexity of Finite Words},
  author={M. Anisiu and Z. Blazsik and Z. K{\'a}sa},
  journal={ArXiv},
  year={2010},
  volume={abs/1002.2724}
}

• M. Anisiu, Z. Blazsik, Z. Kása
• Published 2010
• Mathematics, Computer Science
• ArXiv

The subword complexity of a finite word $w$ of length $N$ is a function which associates to each $n\le N$ the number of all distinct subwords of $w$ having the length $n$. We define the \emph{maximal complexity} C(w) as the maximum of the subword complexity for $n \in \{1,2,..., N \}$, and the \emph{global maximal complexity} K(N) as the maximum of C(w) for all words $w$ of a fixed length $N$ over a finite alphabet. By R(N) we will denote the set of the values $i$ for which there exits a word… Expand

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed