Librería: Multilibro, Collado Villalba, M, España
EUR 24,20
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoSciences 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 el Kilo de más o fracción) Los PEDIDOS DE MENOS DE 6 euros tienen unos gastos de 1 euro .
Publicado por Springer Berlin Heidelberg, 2012
ISBN 10: 3642824587 ISBN 13: 9783642824586
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
EUR 77,86
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 376.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 93,41
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Publicado por Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1985
ISBN 10: 354015227X ISBN 13: 9783540152279
Idioma: Inglés
Librería: Ammareal, Morangis, Francia
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 1985. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Slight signs of wear on the cover. Edition 1985. Ammareal gives back up to 15% of this item's net price to charity organizations.
Publicado por Springer-Verlag GmbH & Co. KG, 1985
ISBN 10: 354015227X ISBN 13: 9783540152279
Idioma: Inglés
Librería: Buchpark, Trebbin, Alemania
EUR 102,49
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Gut. Zustand: Gut | Seiten: 371 | Produktart: Sonstiges.
EUR 90,07
Convertir monedaCantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Publicado por Springer - Verlag, New York / Heidelberg / Berlin / Tokyo, 1985
ISBN 10: 038715227X ISBN 13: 9780387152271
Idioma: Inglés
Librería: About Books, Henderson, NV, Estados Unidos de America
Original o primera edición
EUR 62,65
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: 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.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 52,57
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 99,43
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. Like New. book.
Librería: dsmbooks, Liverpool, Reino Unido
EUR 213,51
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Good. Good. book.
Publicado por Springer Berlin Heidelberg, 2012
ISBN 10: 3642824587 ISBN 13: 9783642824586
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 48,37
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: 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.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 79,42
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: 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.
Publicado por Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2012, 2012
ISBN 10: 3642824587 ISBN 13: 9783642824586
Idioma: Inglés
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 53,49
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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 GmbH, Tiergartenstr. 17, 69121 Heidelberg 376 pp. Englisch.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 82,69
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 376.
Publicado por Springer Berlin Heidelberg Nov 2012, 2012
ISBN 10: 3642824587 ISBN 13: 9783642824586
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 85,55
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: 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.