Improved Upper Bounds on all Maximal $\alpha$-gapped Repeats and Palindromes
Formal Languages and Automata Theory
2018-03-01 v1
Abstract
We show that the number of all maximal -gapped repeats and palindromes of a word of length is at most and , respectively.
Cite
@article{arxiv.1802.10355,
title = {Improved Upper Bounds on all Maximal $\alpha$-gapped Repeats and Palindromes},
author = {Tomohiro I and Dominik Köppl},
journal= {arXiv preprint arXiv:1802.10355},
year = {2018}
}