Given strings P and Q the (exact) string matching problem is to find all positions of substrings in Q matching P . The classical Knuth-Morris-Pratt algorithm [SIAM J. Comput., 1977] solves the string matching problem in linear time which is optimal if we can only read one character at the time. However, most strings are stored in a computer in a packed representation with several characters in ...

A topological term related to the number of self-intersections of the string world-sheet is shown to emerge in the string representation of the Wilson loop in the dilute instanton gas. The coupling constant of this term occurs to be proportional to the topological charge of the instanton gas under consideration. Recently, a string representation of the Wilson loop in the framework of the Method...

In this paper we give a definition for quantum Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a string is the length of the shortest program that can produce this string as its output. It is a measure of the amount of innate randomness (or information) contained in the string. We define the quantum Kolmogorov complexity of a qubit string as the length of the short...

We examine a class of binary strings arising from considerations about stream cipher encryption: to what degree can one guarantee that the number of pairs of entries distance k apart that disagree is equal to the number that agree, for all small k? In a certain sense, a keystream with such a property achieves a degree of unpredictability. The problem is also restated combinatorially in terms of...

Relation between the equations of motion for the massless fields in the heterotic string theory, and the conformal invariance of the o model describing the propagation of the heterotic string in arbitrary background massless fields is discussed. It is emphasized that this Q model contains complete information about the string theory. Finally we discuss the extension of the Hull-Witten proof of ...

A string that minimizes the sum of distances to the strings of a given set is known as (generalized) median string of the set. This concept is important in Pattern Recognition for modelling a (large) set of garbled strings or patterns. The search of such a string is an NP-Hard problem and, therefore, no efficient algorithms to compute the median strings can be designed. Recently a greedy approa...

The generalization of 4D confining string theory to the SU(3)-inspired case is derived. It describes string representation of the Wilson loop in the SU(3)-analogue of compact QED extended by the θ-term. It is shown that although the obtained theory of confining strings differs from that of compact QED, their low-energy limits have the same functional form. This fact leads to the appearance of t...

The knowledge structure called the 2D Cþ-string, proposed by Huang et al., to represent symbolic pictures allows a natural way to construct iconic indexes for images. According to the cutting mechanism of the 2D Cþ-string, an object may be partitioned into several subparts. The number of partitioned subparts is bounded to OðnÞ, where n is the number of objects in the image. Hence, the string le...