Back to Search
Start Over
Sets Represented as the Length-n Factors of a Word
- Publication Year :
- 2013
- Publisher :
- arXiv, 2013.
-
Abstract
- In this paper we consider the following problems: how many different subsets of Sigma^n can occur as set of all length-n factors of a finite word? If a subset is representable, how long a word do we need to represent it? How many such subsets are represented by words of length t? For the first problem, we give upper and lower bounds of the form alpha^(2^n) in the binary case. For the second problem, we give a weak upper bound and some experimental data. For the third problem, we give a closed-form formula in the case where n
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....64b27397d947ba0fdbc253a82a4aa780
- Full Text :
- https://doi.org/10.48550/arxiv.1304.3666