Article ID Journal Published Year Pages File Type
4951985 Theoretical Computer Science 2017 10 Pages PDF
Abstract
The concept of “lost positions” is a recently introduced tool for counting the number of runs in words. We investigate the frequency of lost positions in prefixes of words. This leads to an algorithm that allows to show, using an extensive computer search, that the asymptotic density of runs in binary words is less than 183/193≈0.9482.
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
,