Combinatorial Algorithms Words (16 results)

Sciences Mathematics Algorithms Words Computer Systems sciences Ed. Springer-Verlag. Hard back. 361 pags. 17 x 25cm. Contents: Open problems in Stringology. String Matching. Subword Trees. Data Compression. Counting. Periods and other regularities. Miscellaneous GASTOS DE ENVÍO ORDINARIO HASTA 1 KILO, GRATIS. (3,50 el Kilo de más o fracción) Los PEDIDOS DE MENOS DE 6 euros tienen unos gastos de 1 euro.

Hardcover. Condition: Very Good condition. First Edition. New York / Heidelberg / Berlin / Tokyo: Springer - Verlag, 1985. HARDCOVER first edition. NOT a library discard. Very Good condition. NO owner's name or bookplate. Pages are clean and unmarked. NO highlighting. NO underlining. NO margin notes. Corners mildly bumped. NATO ASI Series, Advanced Science Institutes Series, Series F, Computer and Systems Sciences, Vol 12. Diagrams. Includes a Preface (Open Problems in Stringology) and 6 major sections, as follows: 1) String Matching. 2) Subword Trees. 3) Data Compression. 4) Counting. 5) Periods and other regularities. 6) Miscellaneous. Bibliographical references. Bound in the original white laminated boards, stamped in gray and black. First Edition. Hardcover. Very Good condition/No dust jacket, as issued. 8vo. viii, 363pp. Great Packaging, Fast Shipping.

Condition: New. pp. 376.

Condition: New. In.

PF. Condition: New.

Couverture rigide. Condition: Très bon. Description : Volume 12 of Série F : Computer and System Sciences.

Couverture rigide. Condition: Très bon. Description : Volume 12 of Série F : Computer and System Sciences.

Condition: Gut. Zustand: Gut | Seiten: 371 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Paperback. Condition: Like New. Like New. book.

Condition: new. Questo è un articolo print on demand.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 376 pp. Englisch.

Condition: New. Print on Demand pp. 376 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam.

Condition: New. PRINT ON DEMAND pp. 376.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 com.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 376 pp. Englisch.