We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
Abstract
Consider the set of those binary words with no non-empty factors of the form
xxx^R. Du, Mousavi, Schaeffer, and Shallit asked whether this set of words grows
polynomially or exponentially with length. In this paper, we demonstrate the
existence of upper and lower bounds of the form n^{lg n+o(lg n)} on the number of
such words of length n, where lg n denotes the base-2 logarithm of n.doi.org/10.1016/j.tcs.2015.11.00
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.