Asymptotic Bounds for the Number of Closed and Privileged Words
Daniel Gabrić
Abstract:A word $w$ has a border $u$ if $u$ is a non-empty proper prefix and suffix of $u$. A word $w$ is said to be closed if $w$ is of length at most $1$ or if $w$ has a border that occurs exactly twice in $w$. A word $w$ is said to be privileged if $w$ is of length at most $1$ or if $w$ has a privileged border that occurs exactly twice in $w$. Let $C_k(n)$ (resp. $P_k(n)$) be the number of length $n$ closed (resp. privileged) words over a $k$-letter alphabet. In this paper, we improve existing upper and lower bounds… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.