Combinatorial Algorithms on Words

Combinatorial Algorithms on Words
Author :
Publisher : Springer Science & Business Media
Total Pages : 354
Release :
ISBN-10 : 9783642824562
ISBN-13 : 3642824560
Rating : 4/5 (560 Downloads)

Book Synopsis Combinatorial Algorithms on Words by : Alberto Apostolico

Download or read book Combinatorial Algorithms on Words written by Alberto Apostolico and published by Springer Science & Business Media. This book was released on 2013-06-29 with total page 354 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.


Combinatorial Algorithms on Words Related Books

Combinatorial Algorithms on Words
Language: en
Pages: 354
Authors: Alberto Apostolico
Categories: Mathematics
Type: BOOK - Published: 2013-06-29 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

Combinatorial Algorithms on Words refers to the collection of manipulations of strings of symbols (words) - not necessarily from a finite alphabet - that exploi
Algorithmic Combinatorics on Partial Words
Language: en
Pages: 392
Authors: Francine Blanchet-Sadri
Categories: Computers
Type: BOOK - Published: 2007-11-19 - Publisher: CRC Press

DOWNLOAD EBOOK

The discrete mathematics and theoretical computer science communities have recently witnessed explosive growth in the area of algorithmic combinatorics on words
Applied Combinatorics on Words
Language: en
Pages: 646
Authors: M. Lothaire
Categories: Computers
Type: BOOK - Published: 2005-07-11 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

Publisher Description
Combinatorial Algorithms
Language: en
Pages: 346
Authors: Donald L. Kreher
Categories: Mathematics
Type: BOOK - Published: 1998-12-18 - Publisher: CRC Press

DOWNLOAD EBOOK

This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods app
Jewels Of Stringology: Text Algorithms
Language: en
Pages: 322
Authors: Maxime Crochemore
Categories: Computers
Type: BOOK - Published: 2002-09-16 - Publisher: World Scientific

DOWNLOAD EBOOK

The term “stringology” is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most