Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Algorithms on Words

  • Conference proceedings
  • © 1985

Overview

Editors:
  1. Alberto Apostolico

    1. Department of Computer Sciences, West Lafayette, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Zvi Galil

    1. Department of Computer Science, Columbia University, New York, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: NATO ASI Subseries F: (NATO ASI F, volume 12)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (25 papers)

  1. Front Matter

    Pages I-VIII
    Download chapter 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
      Download chapter 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
      Download chapter 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
      Download chapter 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
      Download chapter 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
Back to top

Keywords

About this book

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.

Editors and Affiliations

  • Department of Computer Sciences, West Lafayette, USA

    Alberto Apostolico

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

    Zvi Galil

Bibliographic Information

  • Book Title: Combinatorial Algorithms on Words

  • Editors: Alberto Apostolico, Zvi Galil

  • Series Title: NATO ASI Subseries F:

  • DOI: https://doi.org/10.1007/978-3-642-82456-2

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1985

  • Softcover ISBN: 978-3-642-82458-6Published: 26 November 2012

  • eBook ISBN: 978-3-642-82456-2Published: 29 June 2013

  • Series ISSN: 0258-1248

  • Edition Number: 1

  • Number of Pages: VIII, 363

  • Topics: Mathematical Logic and Foundations, Combinatorics

Publish with us

Policies and ethics

Back to top

Search

Navigation