Combinatorics on partial word correlations

Abstract

Partial words are strings over a finite alphabet that may contain a number of “do not know” symbols. In this paper, we consider the period and weak period sets of partial words of length n over a finite alphabet, and study the combinatorics of specific representations of them, called correlations, which are binary and ternary vectors of length n indicating… (More)
DOI: 10.1016/j.jcta.2010.03.001

2 Figures and Tables

Topics

  • Presentations referencing similar topics