Hostname: page-component-7f64f4797f-6fdxz Total loading time: 0 Render date: 2025-11-05T06:38:12.141Z Has data issue: false hasContentIssue false
  • English
  • Français

Autocorrelation and the Enumeration of Strings Avoiding a Fixed String

Published online by Cambridge University Press:  01 March 1997

KIMMO ERIKSSON
KIMMO ERIKSSON
Affiliation:
Stockholm University, S-106 09 Stockholm, Sweden (e-mail: kimmo@nada.kth.se)
Get access Rights & Permissions [Opens in a new window]

Abstract

Considering strings over a finite alphabet [Ascr], say that a string is w-avoiding if it does not contain w as a substring. It is known that the number aw(n) of w-avoiding strings of length n depends only on the autocorrelation of w as defined by Guibas–Odlyzko. We give a simple criterion on the autocorrelations of w and w′ for determining whether aw(n) > aw′(n) for all large enough n.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 6 , Issue 1 , March 1997 , pp. 45 - 48
Copyright
1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable