| 书目名称 | Combinatorial Algorithms on Words | | 编辑 | Alberto Apostolico,Zvi Galil | | 视频video | | | 丛书名称 | NATO ASI Subseries F: | | 图书封面 |  | | 描述 | 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 emp | | 出版日期 | Conference proceedings 1985 | | 关键词 | Area; Combinatorics; Matching; Pattern Matching; Turing; VLSI; calculus; coding; coding theory; combinatorial | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-642-82456-2 | | isbn_softcover | 978-3-642-82458-6 | | isbn_ebook | 978-3-642-82456-2Series ISSN 0258-1248 | | issn_series | 0258-1248 | | copyright | Springer-Verlag Berlin Heidelberg 1985 |
The information of publication is updating
|
|
发表于 2025-3-21 18:18:38
