Combinatorics on words:
Combinatorics on words, or finite sequences, is a field which grew simultaneously within disparate branches of mathematics such as group theory and probability. It has grown into an independent theory finding substantial applications in computer science automata theory and linguistics. This volume i...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
1983
|
| Ausgabe: | Second edition |
| Schriftenreihe: | Cambridge mathematical library
|
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 Volltext |
| Zusammenfassung: | Combinatorics on words, or finite sequences, is a field which grew simultaneously within disparate branches of mathematics such as group theory and probability. It has grown into an independent theory finding substantial applications in computer science automata theory and linguistics. This volume is the first to attempt to present a thorough treatment of this theory. All of the main results and techniques are covered. The presentation is accessible to undergraduate and graduate level students in mathematics and computer science as well as to specialists in all branches of applied mathematics. Topics discussed include: Thue's square free words, Van der Waerden's theorem, Ramsey's theorem; factorization of free monoids including application to free Lie algebras; equations in words, etc |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xvii, 238 pages) |
| ISBN: | 9780511566097 |
| DOI: | 10.1017/CBO9780511566097 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043941552 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s1983 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511566097 |c Online |9 978-0-511-56609-7 | ||
| 024 | 7 | |a 10.1017/CBO9780511566097 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511566097 | ||
| 035 | |a (OCoLC)967601091 | ||
| 035 | |a (DE-599)BVBBV043941552 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 511/.6 |2 21 | |
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 100 | 1 | |a Lothaire, M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Combinatorics on words |c M. Lothaire ; foreword by Roger Lyndon |
| 250 | |a Second edition | ||
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1983 | |
| 300 | |a 1 online resource (xvii, 238 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge mathematical library | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 520 | |a Combinatorics on words, or finite sequences, is a field which grew simultaneously within disparate branches of mathematics such as group theory and probability. It has grown into an independent theory finding substantial applications in computer science automata theory and linguistics. This volume is the first to attempt to present a thorough treatment of this theory. All of the main results and techniques are covered. The presentation is accessible to undergraduate and graduate level students in mathematics and computer science as well as to specialists in all branches of applied mathematics. Topics discussed include: Thue's square free words, Van der Waerden's theorem, Ramsey's theorem; factorization of free monoids including application to free Lie algebras; equations in words, etc | ||
| 650 | 4 | |a Combinatorial analysis | |
| 650 | 4 | |a Word problems (Mathematics) | |
| 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 |
| 650 | 0 | 7 | |a Buchstabenposition |0 (DE-588)4146836-3 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Wort |0 (DE-588)4066951-8 |D s |
| 689 | 0 | 1 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Buchstabenposition |0 (DE-588)4146836-3 |D s |
| 689 | 1 | 1 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Lyndon, Roger C. |4 aui | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-59924-5 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511566097 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029350522 | ||
| 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 | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511566097 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511566097 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176883466633216 |
|---|---|
| any_adam_object | |
| author | Lothaire, M. |
| author2 | Lyndon, Roger C. |
| author2_role | aui |
| author2_variant | r c l rc rcl |
| author_facet | Lothaire, M. Lyndon, Roger C. |
| author_role | aut |
| author_sort | Lothaire, M. |
| author_variant | m l ml |
| building | Verbundindex |
| bvnumber | BV043941552 |
| classification_rvk | SK 130 SK 170 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9780511566097 (OCoLC)967601091 (DE-599)BVBBV043941552 |
| dewey-full | 511/.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.6 |
| dewey-search | 511/.6 |
| dewey-sort | 3511 16 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1017/CBO9780511566097 |
| edition | Second edition |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03103nmm a2200589zc 4500</leader><controlfield tag="001">BV043941552</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s1983 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511566097</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-56609-7</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511566097</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511566097</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967601091</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043941552</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.6</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lothaire, M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorics on words</subfield><subfield code="c">M. Lothaire ; foreword by Roger Lyndon</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Second edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1983</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xvii, 238 pages)</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="0" ind2=" "><subfield code="a">Cambridge mathematical library</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Combinatorics on words, or finite sequences, is a field which grew simultaneously within disparate branches of mathematics such as group theory and probability. It has grown into an independent theory finding substantial applications in computer science automata theory and linguistics. This volume is the first to attempt to present a thorough treatment of this theory. All of the main results and techniques are covered. The presentation is accessible to undergraduate and graduate level students in mathematics and computer science as well as to specialists in all branches of applied mathematics. Topics discussed include: Thue's square free words, Van der Waerden's theorem, Ramsey's theorem; factorization of free monoids including application to free Lie algebras; equations in words, etc</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Word problems (Mathematics)</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="650" ind1="0" ind2="7"><subfield code="a">Buchstabenposition</subfield><subfield code="0">(DE-588)4146836-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Wort</subfield><subfield code="0">(DE-588)4066951-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Buchstabenposition</subfield><subfield code="0">(DE-588)4146836-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><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=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lyndon, Roger C.</subfield><subfield code="4">aui</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-59924-5</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511566097</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029350522</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="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511566097</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511566097</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043941552 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:15Z |
| institution | BVB |
| isbn | 9780511566097 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029350522 |
| oclc_num | 967601091 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xvii, 238 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 1983 |
| publishDateSearch | 1983 |
| publishDateSort | 1983 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge mathematical library |
| spelling | Lothaire, M. Verfasser aut Combinatorics on words M. Lothaire ; foreword by Roger Lyndon Second edition Cambridge Cambridge University Press 1983 1 online resource (xvii, 238 pages) txt rdacontent c rdamedia cr rdacarrier Cambridge mathematical library Title from publisher's bibliographic system (viewed on 05 Oct 2015) Combinatorics on words, or finite sequences, is a field which grew simultaneously within disparate branches of mathematics such as group theory and probability. It has grown into an independent theory finding substantial applications in computer science automata theory and linguistics. This volume is the first to attempt to present a thorough treatment of this theory. All of the main results and techniques are covered. The presentation is accessible to undergraduate and graduate level students in mathematics and computer science as well as to specialists in all branches of applied mathematics. Topics discussed include: Thue's square free words, Van der Waerden's theorem, Ramsey's theorem; factorization of free monoids including application to free Lie algebras; equations in words, etc Combinatorial analysis Word problems (Mathematics) Kombinatorik (DE-588)4031824-2 gnd rswk-swf Wort (DE-588)4066951-8 gnd rswk-swf Buchstabenposition (DE-588)4146836-3 gnd rswk-swf Wort (DE-588)4066951-8 s Kombinatorik (DE-588)4031824-2 s 1\p DE-604 Buchstabenposition (DE-588)4146836-3 s 2\p DE-604 Lyndon, Roger C. aui Erscheint auch als Druckausgabe 978-0-521-59924-5 https://doi.org/10.1017/CBO9780511566097 Verlag URL des Erstveröffentlichers 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 |
| spellingShingle | Lothaire, M. Combinatorics on words Combinatorial analysis Word problems (Mathematics) Kombinatorik (DE-588)4031824-2 gnd Wort (DE-588)4066951-8 gnd Buchstabenposition (DE-588)4146836-3 gnd |
| subject_GND | (DE-588)4031824-2 (DE-588)4066951-8 (DE-588)4146836-3 |
| title | Combinatorics on words |
| title_auth | Combinatorics on words |
| title_exact_search | Combinatorics on words |
| title_full | Combinatorics on words M. Lothaire ; foreword by Roger Lyndon |
| title_fullStr | Combinatorics on words M. Lothaire ; foreword by Roger Lyndon |
| title_full_unstemmed | Combinatorics on words M. Lothaire ; foreword by Roger Lyndon |
| title_short | Combinatorics on words |
| title_sort | combinatorics on words |
| topic | Combinatorial analysis Word problems (Mathematics) Kombinatorik (DE-588)4031824-2 gnd Wort (DE-588)4066951-8 gnd Buchstabenposition (DE-588)4146836-3 gnd |
| topic_facet | Combinatorial analysis Word problems (Mathematics) Kombinatorik Wort Buchstabenposition |
| url | https://doi.org/10.1017/CBO9780511566097 |
| work_keys_str_mv | AT lothairem combinatoricsonwords AT lyndonrogerc combinatoricsonwords |