Periods and borders of random words

From MaRDI portal
Publication:4601896

DOI10.4230/LIPICS.STACS.2016.44zbMATH Open1388.68244arXiv1509.05240WikidataQ105468635 ScholiaQ105468635MaRDI QIDQ4601896FDOQ4601896


Authors: Štěpán Holub, Jeffrey Shallit Edit this on Wikidata


Publication date: 24 January 2018

Abstract: We investigate the behavior of the periods and border lengths of random words over a fixed alphabet. We show that the asymptotic probability that a random word has a given maximal border length k is a constant, depending only on k and the alphabet size ell. We give a recurrence that allows us to determine these constants with any required precision. This also allows us to evaluate the expected period of a random word. For the binary case, the expected period is asymptotically about n1.641. We also give explicit formulas for the probability that a random word is unbordered or has maximum border length one.


Full work available at URL: https://arxiv.org/abs/1509.05240




Recommendations





Cited In (13)





This page was built for publication: Periods and borders of random words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601896)