Combinatorial Algorithms on Words:
Gespeichert in:
| Weitere Verfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1985
|
| Schriftenreihe: | NATO ASI Series, Series F: Computer and Systems Sciences
12 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | 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 interesting, 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 complexity 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 automata and formal languages, we have allocated very little space to them |
| Beschreibung: | 1 Online-Ressource (VIII, 363 p) |
| ISBN: | 9783642824562 9783642824586 |
| DOI: | 10.1007/978-3-642-82456-2 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042423038 | ||
| 003 | DE-604 | ||
| 005 | 20171019 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s1985 |||| o||u| ||||||eng d | ||
| 020 | |a 9783642824562 |c Online |9 978-3-642-82456-2 | ||
| 020 | |a 9783642824586 |c Print |9 978-3-642-82458-6 | ||
| 024 | 7 | |a 10.1007/978-3-642-82456-2 |2 doi | |
| 035 | |a (OCoLC)864045635 | ||
| 035 | |a (DE-599)BVBBV042423038 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 511.3 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 245 | 1 | 0 | |a Combinatorial Algorithms on Words |c edited by Alberto Apostolico, Zvi Galil |
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 1985 | |
| 300 | |a 1 Online-Ressource (VIII, 363 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a NATO ASI Series, Series F: Computer and Systems Sciences |v 12 | |
| 500 | |a 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 interesting, 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 complexity 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 automata and formal languages, we have allocated very little space to them | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Logic, Symbolic and mathematical | |
| 650 | 4 | |a Mathematical Logic and Foundations | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Wortproblem |0 (DE-588)4337256-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorik |0 (DE-588)4031824-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Wort |0 (DE-588)4066951-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)1071861417 |a Konferenzschrift |y 1984 |z Maratea |2 gnd-content | |
| 689 | 0 | 0 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 2 | |a Wortproblem |0 (DE-588)4337256-9 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 689 | 1 | 0 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
| 689 | 1 | 1 | |a Wort |0 (DE-588)4066951-8 |D s |
| 689 | 1 | |8 3\p |5 DE-604 | |
| 700 | 1 | |a Apostolico, Alberto |4 edt | |
| 700 | 1 | |a Galil, Zvi |4 edt | |
| 810 | 2 | |a NATO ASI Series, Series F |t Computer and Systems Sciences |v 12 |w (DE-604)BV000013052 |9 12 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-82456-2 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027858455 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153098307895296 |
|---|---|
| any_adam_object | |
| author2 | Apostolico, Alberto Galil, Zvi |
| author2_role | edt edt |
| author2_variant | a a aa z g zg |
| author_facet | Apostolico, Alberto Galil, Zvi |
| building | Verbundindex |
| bvnumber | BV042423038 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)864045635 (DE-599)BVBBV042423038 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-3-642-82456-2 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03889nmm a2200625zcb4500</leader><controlfield tag="001">BV042423038</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20171019 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1985 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642824562</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-642-82456-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642824586</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-642-82458-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-82456-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)864045635</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042423038</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorial Algorithms on Words</subfield><subfield code="c">edited by Alberto Apostolico, Zvi Galil</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VIII, 363 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">NATO ASI Series, Series F: Computer and Systems Sciences</subfield><subfield code="v">12</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">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 interesting, 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 complexity 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 automata and formal languages, we have allocated very little space to them</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Logic and Foundations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Wortproblem</subfield><subfield code="0">(DE-588)4337256-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Wort</subfield><subfield code="0">(DE-588)4066951-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1984</subfield><subfield code="z">Maratea</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Wortproblem</subfield><subfield code="0">(DE-588)4337256-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Wort</subfield><subfield code="0">(DE-588)4066951-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Apostolico, Alberto</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Galil, Zvi</subfield><subfield code="4">edt</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">NATO ASI Series, Series F</subfield><subfield code="t">Computer and Systems Sciences</subfield><subfield code="v">12</subfield><subfield code="w">(DE-604)BV000013052</subfield><subfield code="9">12</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-82456-2</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027858455</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)1071861417 Konferenzschrift 1984 Maratea gnd-content |
| genre_facet | Konferenzschrift 1984 Maratea |
| id | DE-604.BV042423038 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:12Z |
| institution | BVB |
| isbn | 9783642824562 9783642824586 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027858455 |
| oclc_num | 864045635 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (VIII, 363 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| publisher | Springer Berlin Heidelberg |
| record_format | marc |
| series2 | NATO ASI Series, Series F: Computer and Systems Sciences |
| spelling | Combinatorial Algorithms on Words edited by Alberto Apostolico, Zvi Galil Berlin, Heidelberg Springer Berlin Heidelberg 1985 1 Online-Ressource (VIII, 363 p) txt rdacontent c rdamedia cr rdacarrier NATO ASI Series, Series F: Computer and Systems Sciences 12 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 interesting, 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 complexity 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 automata and formal languages, we have allocated very little space to them Mathematics Combinatorics Logic, Symbolic and mathematical Mathematical Logic and Foundations Mathematik Algorithmus (DE-588)4001183-5 gnd rswk-swf Wortproblem (DE-588)4337256-9 gnd rswk-swf Kombinatorik (DE-588)4031824-2 gnd rswk-swf Wort (DE-588)4066951-8 gnd rswk-swf 1\p (DE-588)1071861417 Konferenzschrift 1984 Maratea gnd-content Kombinatorik (DE-588)4031824-2 s Algorithmus (DE-588)4001183-5 s Wortproblem (DE-588)4337256-9 s 2\p DE-604 Wort (DE-588)4066951-8 s 3\p DE-604 Apostolico, Alberto edt Galil, Zvi edt NATO ASI Series, Series F Computer and Systems Sciences 12 (DE-604)BV000013052 12 https://doi.org/10.1007/978-3-642-82456-2 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Combinatorial Algorithms on Words Mathematics Combinatorics Logic, Symbolic and mathematical Mathematical Logic and Foundations Mathematik Algorithmus (DE-588)4001183-5 gnd Wortproblem (DE-588)4337256-9 gnd Kombinatorik (DE-588)4031824-2 gnd Wort (DE-588)4066951-8 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4337256-9 (DE-588)4031824-2 (DE-588)4066951-8 (DE-588)1071861417 |
| title | Combinatorial Algorithms on Words |
| title_auth | Combinatorial Algorithms on Words |
| title_exact_search | Combinatorial Algorithms on Words |
| title_full | Combinatorial Algorithms on Words edited by Alberto Apostolico, Zvi Galil |
| title_fullStr | Combinatorial Algorithms on Words edited by Alberto Apostolico, Zvi Galil |
| title_full_unstemmed | Combinatorial Algorithms on Words edited by Alberto Apostolico, Zvi Galil |
| title_short | Combinatorial Algorithms on Words |
| title_sort | combinatorial algorithms on words |
| topic | Mathematics Combinatorics Logic, Symbolic and mathematical Mathematical Logic and Foundations Mathematik Algorithmus (DE-588)4001183-5 gnd Wortproblem (DE-588)4337256-9 gnd Kombinatorik (DE-588)4031824-2 gnd Wort (DE-588)4066951-8 gnd |
| topic_facet | Mathematics Combinatorics Logic, Symbolic and mathematical Mathematical Logic and Foundations Mathematik Algorithmus Wortproblem Kombinatorik Wort Konferenzschrift 1984 Maratea |
| url | https://doi.org/10.1007/978-3-642-82456-2 |
| volume_link | (DE-604)BV000013052 |
| work_keys_str_mv | AT apostolicoalberto combinatorialalgorithmsonwords AT galilzvi combinatorialalgorithmsonwords |