Combinatorial Algorithms on Words

1. Front Matter

   Pages I-VIII

   PDF

2. Open Problems in Stringology

   1. Open Problems in Stringology

      • Zvi Galil

      Pages 1-8

3. String Matching

   1. Front Matter

      Pages 9-9

      PDF

   2. Efficient String Matching with Don’t-Care Patterns

      • Ron Y. Pinter

      Pages 11-29

   3. Optimal Factor Transducers

      • Maxime Crochemore

      Pages 31-43

   4. Relating the Average-Case Costs of the Brute-Force and Knuth-Morris-Pratt String Matching Algorithm

      • Gerhard Barth

      Pages 45-58

   5. Algorithms for Factorizing and Testing Subsemigroups

      • Renato M. Capocelli, Christoph M. Hoffmann

      Pages 59-81

4. Subword Trees

   1. Front Matter

      Pages 83-83

      PDF

   2. The Myriad Virtues of Subword Trees

      • Alberto Apostolico

      Pages 85-96

   3. Efficient and Elegant Subword-Tree Construction

      • M. T. Chen, Joel Seiferas

      Pages 97-107

5. Data Compression

   1. Front Matter

      Pages 109-109

      PDF

   2. Textual Substitution Techniques for Data Compression

      • James A. Storer

      Pages 111-129

   3. Variations on a theme by Ziv and Lempel

      • Victor S. Miller, Mark N. Wegman

      Pages 131-140

   4. Compression of Two-Dimensional Images

      • Abraham Lempel, Jacob Ziv

      Pages 141-154

   5. Optimal Parsing of Strings

      • Alan Hartman, Michael Rodeh

      Pages 155-167

   6. Novel Compression of Sparse Bit-Strings — Preliminary Report

      • Aviezri S. Fraenkel, Shmuel T. Klein

      Pages 169-183

6. Counting

   1. Front Matter

      Pages 185-185

      PDF

   2. The Use and Usefulness of Numeration Systems

      • Aviezri S. Fraenkel

      Pages 187-203

   3. Enumeration of Strings

      • A. M. Odlyzko

      Pages 205-228

   4. Two counting problems solved via string encodings

      • Andrei Broder

      Pages 229-240

Combinatorial Algorithms on Words refers to the collection of manipulations of strings of symbols (words) - not necessarily from a finite alphabet - that exploit the combinatorial properties of the logical/physical input arrangement to achieve efficient computational performances. The model of computation may be any of the established serial paradigms (e.g. RAM's, Turing Machines), or one of the emerging parallel models (e.g. PRAM ,WRAM, Systolic Arrays, CCC). This book focuses on some of the accomplishments of recent years in such disparate areas as pattern matching, data compression, free groups, coding theory, parallel and VLSI computation, and symbolic dynamics; these share a common flavor, yet ltave not been examined together in the past. In addition to being theoretically interest­ ing, these studies have had significant applications. It happens that these works have all too frequently been carried out in isolation, with contributions addressing similar issues scattered throughout a rather diverse body of literature. We felt that it would be advantageous to both current and future researchers to collect this work in a sin­ gle reference. It should be clear that the book's emphasis is on aspects of combinatorics and com­ plexity rather than logic, foundations, and decidability. In view of the large body of research and the degree of unity already achieved by studies in the theory of auto­ mata and formal languages, we have allocated very little space to them.

• Area
• Combinatorics
• Matching
• Pattern Matching
• Turing
• VLSI
• calculus
• coding
• coding theory
• combinatorial algorithm
• data compression
• formal language
• formal languages
• language
• model

• Department of Computer Sciences, West Lafayette, USA

  Alberto Apostolico

• Department of Computer Science, Columbia University, New York, USA

  Zvi Galil

Policies and ethics