We propose in this paper a definition of the normal law on the space of strings. This definition allows generations of sets of strings that have controled statistical features. Mo...
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
The online squarefree recognition problem is to detect the first occurrence of a square in a string whose characters are provided as input one at a time. We present an efficient a...
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
This paper proposes a method to accelerate character recognition of a large character set by employing pivots into the search space. We divide the feature space of character categ...