This article addresses the online exact string matching problem which consists in finding all
occurrences of a given pattern p in a text t. It is an extensively studied problem in computer …

Combinatorics on words has arisen independently within several branches of mathematics,
for instance, number theory, group theory and probability, and appears frequently in …

The need for a comprehensive survey-type exposition on formal languages and related
mainstream areas of computer science has been evident for some years. In the early 1970s …

During the last two decades research on combinatorial problems of words, ie, on
Combinatorics on Words, has grown enormously. Although there has been important …

The proliferation of online text, such as on the World Wide Web and in databases, motivates
the need for space-efficient index methods that support fast search. Consider a text T of n …

The book is intended for lectures on string processes and pattern matching in Master's
courses of computer science and software engineering curricula. The details of algorithms …

Recent years have witnessed a dramatic increase of interest in sophisticated string matching
problems, especially in information retrieval and computational biology. This book presents …

The basic object of this chapter is a word, that is a sequence-finite or infinite-of elements
from a finite set. The very definition of a word immediately imposes two characteristic …

String searching is a subject of both theoretical and practical interest in computer science.
This book presents a bibliographic overview of the field and an anthology of detailed …

The phenomenal growth of the Internet in the last decade and society's increasing
dependence on it has brought along, a flood of security attacks on the networking and …