Combinatorial Algorithms on Words, 1

Name: Combinatorial Algorithms on Words, 1
Brand: Springer, Berlin
SKU: 9783642824586
Price: 19840 HUF
Availability: InStock

Szerző: Alberto Apostolico, Zvi Galil

Nyelv:

Kötés: Puha kötésű

Kiadó: Springer, Berlin

Elérhetőség: Beszállítói készleten

Küldés 5-8 napon belül

19 840 Ft

Combinatorial Algorithms on Words refers to the collection of manipulations of strings of symbols (w...

Információk a könyvről

Szerző

Alberto Apostolico, Zvi Galil

Nyelv

Angol

Kötés

Könyv - Puha kötésű

Kiadva

2012

oldal

363

EAN

9783642824586

ISBN

3642824587

Enbook ID

02007298

Kiadó

Springer, Berlin

Súly

647

Méretek

170 x 244 x 20

Teljes leírás

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.

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Combinatorial Algorithms on Words, 1

Információk a könyvről

Teljes leírás

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták