Combinatorial Algorithms Words (16 results)
- Hardcover
Seller: Multilibro, Collado Villalba, M, SpainMultilibro
Contact seller5-star sellerCondition: Used
£ 11.71
£ 26.62 shippingShips from Spain to U.S.A.Quantity: 1 available
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.
Language: English
Published by Springer - Verlag, New York / Heidelberg / Berlin / Tokyo, 1985
- Hardcover
- First Edition
Seller: About Books, Henderson, NV, U.S.A.About Books
Contact seller5-star sellerCondition: Used - Very good
£ 55.58
£ 5.25 shippingShips within U.S.A.Quantity: 1 available
Hardcover. Condition: Very Good condition. Dust Jacket Condition: No dust jacket, as issued. 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 underlin…ing. 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.
- Softcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 70.64
£ 3.01 shippingShips within U.S.A.Quantity: 4 available
Condition: New. pp. 376.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 78.46
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
£ 76.10
£ 15.49 shippingShips from United Kingdom to U.S.A.Quantity: 10 available
PF. Condition: New.
Language: English
Published by Springer-Verlag / NATO Scientific Affairs Division, 1985
- Hardcover
Seller: Aberbroc, Plonévez du Faou, FranceAberbroc
Contact seller4-star sellerCondition: Used - Fine
£ 44.36
£ 55.99 shippingShips from France to U.S.A.Quantity: 1 available
Couverture rigide. Condition: Très bon. Description : Volume 12 of Série F : Computer and System Sciences.
Language: English
Published by Springer-Verlag / NATO Scientific Affairs Division, 1985
- Hardcover
Seller: Aberbroc, Plonévez du Faou, FranceAberbroc
Contact seller4-star sellerCondition: Used - Fine
£ 44.36
£ 55.99 shippingShips from France to U.S.A.Quantity: 1 available
Couverture rigide. Condition: Très bon. Description : Volume 12 of Série F : Computer and System Sciences.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 47.45
£ 54.47 shippingShips from Germany to U.S.A.Quantity: 1 available
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 effi…cient 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.
- Softcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
£ 84.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Like New. Like New. book.
- Hardcover
Seller: Buchpark, Trebbin, GermanyBuchpark
Contact seller5-star sellerCondition: Used - Very good
£ 41.47
£ 90.44 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: Gut. Zustand: Gut | Seiten: 371 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.
- Softcover
- Print on Demand
Seller: Brook Bookstore On Demand, Napoli, NA, ItalyBrook Bookstore On Demand
Contact seller5-star sellerCondition: New
£ 41.01
£ 5.86 shippingShips from Italy to U.S.A.Quantity: Over 20 available
Condition: new. Questo è un articolo print on demand.
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 47.45
£ 19.81 shippingShips from Germany to U.S.A.Quantity: 2 available
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.
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
£ 70.14
£ 6.50 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
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.
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
£ 72.11
£ 8.57 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND pp. 376.
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 42.91
£ 42.20 shippingShips from Germany to U.S.A.Quantity: Over 20 available
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 in…put arrangement to achieve efficient com.
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
£ 47.45
£ 51.68 shippingShips from Germany to U.S.A.Quantity: 1 available
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.
