Algebraic combinatorics on words /:
Combinatorics on words has arisen independently within several branches of mathematics, for instance number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of the area was given in Lothaire's book Comb...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge ; New York :
Cambridge University Press,
2002.
|
| Schriftenreihe: | Encyclopedia of mathematics and its applications ;
v. 90. |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | Combinatorics on words has arisen independently within several branches of mathematics, for instance number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of the area was given in Lothaire's book Combinatorics on Words. Originally published in 2002, this book presents several more topics and provides deeper insights into subjects discussed in the previous volume. An introductory chapter provides the reader with all the necessary background material. There are numerous examples, full proofs whenever possible and a notes section discussing further developments in the area. This book is both a comprehensive introduction to the subject and a valuable reference source for researchers. |
| Beschreibung: | 1 online resource (xiii, 504 pages) : illustrations |
| Bibliographie: | Includes bibliographical references (pages 473-496) and indexes. |
| ISBN: | 9781107089556 1107089557 9781107326019 110732601X 9781107095878 1107095875 1139885685 9781139885683 1107103975 9781107103979 9780521180719 0521180716 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn852898445 | ||
| 003 | OCoLC | ||
| 005 | 20240705115654.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 130716s2002 enka ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d CAMBR |d IDEBK |d E7B |d OCLCF |d EBLCP |d DEBSZ |d EUX |d YDXCP |d OCLCQ |d AGLDB |d YDX |d OCLCO |d OCLCQ |d UAB |d VTS |d STF |d AU@ |d OCLCO |d M8D |d UKAHL |d HS0 |d OCLCQ |d K6U |d INARC |d VLY |d LUN |d MM9 |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d OCLCL |d SFB |d OCLCQ | ||
| 019 | |a 841393158 |a 853360426 |a 985252093 |a 985397548 |a 1108944414 |a 1145811244 |a 1162023535 |a 1170367379 |a 1170816649 |a 1173187497 |a 1241900864 |a 1242482697 | ||
| 020 | |a 9781107089556 |q (electronic bk.) | ||
| 020 | |a 1107089557 |q (electronic bk.) | ||
| 020 | |a 9781107326019 |q (electronic bk.) | ||
| 020 | |a 110732601X |q (electronic bk.) | ||
| 020 | |a 9781107095878 | ||
| 020 | |a 1107095875 | ||
| 020 | |a 1139885685 | ||
| 020 | |a 9781139885683 | ||
| 020 | |a 1107103975 | ||
| 020 | |a 9781107103979 | ||
| 020 | |a 9780521180719 |q (paperback) | ||
| 020 | |a 0521180716 | ||
| 020 | |z 0521812208 | ||
| 020 | |z 9780521812207 | ||
| 035 | |a (OCoLC)852898445 |z (OCoLC)841393158 |z (OCoLC)853360426 |z (OCoLC)985252093 |z (OCoLC)985397548 |z (OCoLC)1108944414 |z (OCoLC)1145811244 |z (OCoLC)1162023535 |z (OCoLC)1170367379 |z (OCoLC)1170816649 |z (OCoLC)1173187497 |z (OCoLC)1241900864 |z (OCoLC)1242482697 | ||
| 050 | 4 | |a QA164 |b .L65 2002eb | |
| 072 | 7 | |a MAT |x 036000 |2 bisacsh | |
| 072 | 7 | |a PBF. |2 bicssc | |
| 072 | 7 | |a PBV. |2 bicssc | |
| 082 | 7 | |a 511/.6 |2 22 | |
| 084 | |a 31.12 |2 bcl | ||
| 049 | |a MAIN | ||
| 100 | 1 | |a Lothaire, M. | |
| 245 | 1 | 0 | |a Algebraic combinatorics on words / |c M. Lothaire. |
| 260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c 2002. | ||
| 300 | |a 1 online resource (xiii, 504 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Encyclopedia of mathematics and its applications ; |v v. 90 | |
| 504 | |a Includes bibliographical references (pages 473-496) and indexes. | ||
| 505 | 0 | 0 | |t Finite and Infinite Words -- |t Semigroups -- |t Words -- |t Automata -- |t Generating series -- |t Symbolic dynamical systems -- |t Unavoidable sets -- |t Sturmian Words -- |t Equivalent definitions -- |t Standard words -- |t Sturmian morphisms -- |t Unavoidable Patterns -- |t Definitions and basic properties -- |t Deciding avoidability: the Zimin algorithm -- |t Avoidability on a fixed alphabet -- |t Sesquipowers -- |t Bi-ideal sequences -- |t Canonical factorizations -- |t Sesquipowers and recurrence -- |t Extensions of a theorem of Shirshov -- |t Finiteness conditions for semigroups -- |t The Plactic Monoid -- |t Schensted's algorithm -- |t Greene's invariants and the plactic monoid -- |t The Robinson--Schensted--Knuth correspondence -- |t Schur functions and the Littlewood--Richardson rule -- |t Coplactic operations -- |t Cyclage and canonical embeddings -- |t Codes -- |t X-factorizations -- |t Defect -- |t More defect -- |t A theorem of Schutzenberger -- |t Numeration Systems -- |t Standard representation of numbers -- |t Beta-expansions -- |t U-representations -- |t Representation of complex numbers -- |t Periodicity -- |t Periods in a finite word -- |t Local versus global periodicity -- |t Infinite words -- |t Centralizers of Noncommutative Series and Polynomials -- |t Cohn's centralizer theorem -- |t Euclidean division and principal right ideals -- |t Integral closure of the centralizer -- |t Homomorphisms into k[t] -- |t Bergman's centralizer theorem -- |t Free subalgebras and the defect theorem -- |t Appendix: some commutative algebra -- |t Transformations on Words and q-Calculus -- |t The q-binomial coefficients -- |t The MacMahon Verfahren. |
| 588 | 0 | |a Print version record. | |
| 520 | |a Combinatorics on words has arisen independently within several branches of mathematics, for instance number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of the area was given in Lothaire's book Combinatorics on Words. Originally published in 2002, this book presents several more topics and provides deeper insights into subjects discussed in the previous volume. An introductory chapter provides the reader with all the necessary background material. There are numerous examples, full proofs whenever possible and a notes section discussing further developments in the area. This book is both a comprehensive introduction to the subject and a valuable reference source for researchers. | ||
| 546 | |a English. | ||
| 650 | 0 | |a Combinatorial analysis. |0 http://id.loc.gov/authorities/subjects/sh85028802 | |
| 650 | 0 | |a Word problems (Mathematics) |0 http://id.loc.gov/authorities/subjects/sh85148106 | |
| 650 | 6 | |a Analyse combinatoire. | |
| 650 | 6 | |a Problèmes des mots (Mathématiques) | |
| 650 | 7 | |a MATHEMATICS |x Combinatorics. |2 bisacsh | |
| 650 | 7 | |a Combinatorial analysis |2 fast | |
| 650 | 7 | |a Word problems (Mathematics) |2 fast | |
| 650 | 7 | |a Wortproblem |2 gnd |0 http://d-nb.info/gnd/4337256-9 | |
| 650 | 7 | |a Kombinatorische Analysis |2 gnd |0 http://d-nb.info/gnd/4164746-4 | |
| 758 | |i has work: |a Algebraic combinatorics on words (Text) |1 https://id.oclc.org/worldcat/entity/E39PD3fDm4HcTVtJ94Y4bhpfD3 |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Lothaire, M. |t Algebraic combinatorics on words. |d Cambridge ; New York : Cambridge University Press, 2002 |z 0521812208 |w (DLC) 2001037964 |w (OCoLC)47297624 |
| 830 | 0 | |a Encyclopedia of mathematics and its applications ; |v v. 90. |0 http://id.loc.gov/authorities/names/n42010632 | |
| 856 | 1 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=569297 |3 Volltext | |
| 856 | 1 | |l CBO01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=569297 |3 Volltext | |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH25052494 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH26385411 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL1179098 | ||
| 938 | |a ebrary |b EBRY |n ebr10733666 | ||
| 938 | |a EBSCOhost |b EBSC |n 569297 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n cis26006794 | ||
| 938 | |a Internet Archive |b INAR |n algebraiccombina0000loth | ||
| 938 | |a YBP Library Services |b YANK |n 10862046 | ||
| 938 | |a YBP Library Services |b YANK |n 10866285 | ||
| 938 | |a YBP Library Services |b YANK |n 10869783 | ||
| 938 | |a YBP Library Services |b YANK |n 10440794 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn852898445 |
|---|---|
| _version_ | 1813903615834718208 |
| adam_text | |
| any_adam_object | |
| author | Lothaire, M. |
| author_facet | Lothaire, M. |
| author_role | |
| author_sort | Lothaire, M. |
| author_variant | m l ml |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA164 |
| callnumber-raw | QA164 .L65 2002eb |
| callnumber-search | QA164 .L65 2002eb |
| callnumber-sort | QA 3164 L65 42002EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Finite and Infinite Words -- Semigroups -- Words -- Automata -- Generating series -- Symbolic dynamical systems -- Unavoidable sets -- Sturmian Words -- Equivalent definitions -- Standard words -- Sturmian morphisms -- Unavoidable Patterns -- Definitions and basic properties -- Deciding avoidability: the Zimin algorithm -- Avoidability on a fixed alphabet -- Sesquipowers -- Bi-ideal sequences -- Canonical factorizations -- Sesquipowers and recurrence -- Extensions of a theorem of Shirshov -- Finiteness conditions for semigroups -- The Plactic Monoid -- Schensted's algorithm -- Greene's invariants and the plactic monoid -- The Robinson--Schensted--Knuth correspondence -- Schur functions and the Littlewood--Richardson rule -- Coplactic operations -- Cyclage and canonical embeddings -- Codes -- X-factorizations -- Defect -- More defect -- A theorem of Schutzenberger -- Numeration Systems -- Standard representation of numbers -- Beta-expansions -- U-representations -- Representation of complex numbers -- Periodicity -- Periods in a finite word -- Local versus global periodicity -- Infinite words -- Centralizers of Noncommutative Series and Polynomials -- Cohn's centralizer theorem -- Euclidean division and principal right ideals -- Integral closure of the centralizer -- Homomorphisms into k[t] -- Bergman's centralizer theorem -- Free subalgebras and the defect theorem -- Appendix: some commutative algebra -- Transformations on Words and q-Calculus -- The q-binomial coefficients -- The MacMahon Verfahren. |
| ctrlnum | (OCoLC)852898445 |
| 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 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06354cam a2200841 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn852898445</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20240705115654.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">130716s2002 enka ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">CAMBR</subfield><subfield code="d">IDEBK</subfield><subfield code="d">E7B</subfield><subfield code="d">OCLCF</subfield><subfield code="d">EBLCP</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">EUX</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AGLDB</subfield><subfield code="d">YDX</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UAB</subfield><subfield code="d">VTS</subfield><subfield code="d">STF</subfield><subfield code="d">AU@</subfield><subfield code="d">OCLCO</subfield><subfield code="d">M8D</subfield><subfield code="d">UKAHL</subfield><subfield code="d">HS0</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">K6U</subfield><subfield code="d">INARC</subfield><subfield code="d">VLY</subfield><subfield code="d">LUN</subfield><subfield code="d">MM9</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">841393158</subfield><subfield code="a">853360426</subfield><subfield code="a">985252093</subfield><subfield code="a">985397548</subfield><subfield code="a">1108944414</subfield><subfield code="a">1145811244</subfield><subfield code="a">1162023535</subfield><subfield code="a">1170367379</subfield><subfield code="a">1170816649</subfield><subfield code="a">1173187497</subfield><subfield code="a">1241900864</subfield><subfield code="a">1242482697</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107089556</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107089557</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107326019</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">110732601X</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107095878</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107095875</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139885685</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139885683</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107103975</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107103979</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521180719</subfield><subfield code="q">(paperback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521180716</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521812208</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521812207</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)852898445</subfield><subfield code="z">(OCoLC)841393158</subfield><subfield code="z">(OCoLC)853360426</subfield><subfield code="z">(OCoLC)985252093</subfield><subfield code="z">(OCoLC)985397548</subfield><subfield code="z">(OCoLC)1108944414</subfield><subfield code="z">(OCoLC)1145811244</subfield><subfield code="z">(OCoLC)1162023535</subfield><subfield code="z">(OCoLC)1170367379</subfield><subfield code="z">(OCoLC)1170816649</subfield><subfield code="z">(OCoLC)1173187497</subfield><subfield code="z">(OCoLC)1241900864</subfield><subfield code="z">(OCoLC)1242482697</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA164</subfield><subfield code="b">.L65 2002eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">036000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">PBF.</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">PBV.</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511/.6</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.12</subfield><subfield code="2">bcl</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lothaire, M.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algebraic combinatorics on words /</subfield><subfield code="c">M. Lothaire.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">2002.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiii, 504 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Encyclopedia of mathematics and its applications ;</subfield><subfield code="v">v. 90</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 473-496) and indexes.</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Finite and Infinite Words --</subfield><subfield code="t">Semigroups --</subfield><subfield code="t">Words --</subfield><subfield code="t">Automata --</subfield><subfield code="t">Generating series --</subfield><subfield code="t">Symbolic dynamical systems --</subfield><subfield code="t">Unavoidable sets --</subfield><subfield code="t">Sturmian Words --</subfield><subfield code="t">Equivalent definitions --</subfield><subfield code="t">Standard words --</subfield><subfield code="t">Sturmian morphisms --</subfield><subfield code="t">Unavoidable Patterns --</subfield><subfield code="t">Definitions and basic properties --</subfield><subfield code="t">Deciding avoidability: the Zimin algorithm --</subfield><subfield code="t">Avoidability on a fixed alphabet --</subfield><subfield code="t">Sesquipowers --</subfield><subfield code="t">Bi-ideal sequences --</subfield><subfield code="t">Canonical factorizations --</subfield><subfield code="t">Sesquipowers and recurrence --</subfield><subfield code="t">Extensions of a theorem of Shirshov --</subfield><subfield code="t">Finiteness conditions for semigroups --</subfield><subfield code="t">The Plactic Monoid --</subfield><subfield code="t">Schensted's algorithm --</subfield><subfield code="t">Greene's invariants and the plactic monoid --</subfield><subfield code="t">The Robinson--Schensted--Knuth correspondence --</subfield><subfield code="t">Schur functions and the Littlewood--Richardson rule --</subfield><subfield code="t">Coplactic operations --</subfield><subfield code="t">Cyclage and canonical embeddings --</subfield><subfield code="t">Codes --</subfield><subfield code="t">X-factorizations --</subfield><subfield code="t">Defect --</subfield><subfield code="t">More defect --</subfield><subfield code="t">A theorem of Schutzenberger --</subfield><subfield code="t">Numeration Systems --</subfield><subfield code="t">Standard representation of numbers --</subfield><subfield code="t">Beta-expansions --</subfield><subfield code="t">U-representations --</subfield><subfield code="t">Representation of complex numbers --</subfield><subfield code="t">Periodicity --</subfield><subfield code="t">Periods in a finite word --</subfield><subfield code="t">Local versus global periodicity --</subfield><subfield code="t">Infinite words --</subfield><subfield code="t">Centralizers of Noncommutative Series and Polynomials --</subfield><subfield code="t">Cohn's centralizer theorem --</subfield><subfield code="t">Euclidean division and principal right ideals --</subfield><subfield code="t">Integral closure of the centralizer --</subfield><subfield code="t">Homomorphisms into k[t] --</subfield><subfield code="t">Bergman's centralizer theorem --</subfield><subfield code="t">Free subalgebras and the defect theorem --</subfield><subfield code="t">Appendix: some commutative algebra --</subfield><subfield code="t">Transformations on Words and q-Calculus --</subfield><subfield code="t">The q-binomial coefficients --</subfield><subfield code="t">The MacMahon Verfahren.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Combinatorics on words has arisen independently within several branches of mathematics, for instance number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of the area was given in Lothaire's book Combinatorics on Words. Originally published in 2002, this book presents several more topics and provides deeper insights into subjects discussed in the previous volume. An introductory chapter provides the reader with all the necessary background material. There are numerous examples, full proofs whenever possible and a notes section discussing further developments in the area. This book is both a comprehensive introduction to the subject and a valuable reference source for researchers.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Combinatorial analysis.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85028802</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Word problems (Mathematics)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85148106</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Analyse combinatoire.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Problèmes des mots (Mathématiques)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Combinatorics.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatorial analysis</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Word problems (Mathematics)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Wortproblem</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4337256-9</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Kombinatorische Analysis</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4164746-4</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Algebraic combinatorics on words (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PD3fDm4HcTVtJ94Y4bhpfD3</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Lothaire, M.</subfield><subfield code="t">Algebraic combinatorics on words.</subfield><subfield code="d">Cambridge ; New York : Cambridge University Press, 2002</subfield><subfield code="z">0521812208</subfield><subfield code="w">(DLC) 2001037964</subfield><subfield code="w">(OCoLC)47297624</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Encyclopedia of mathematics and its applications ;</subfield><subfield code="v">v. 90.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n42010632</subfield></datafield><datafield tag="856" ind1="1" ind2=" "><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=569297</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="1" ind2=" "><subfield code="l">CBO01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=569297</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH25052494</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH26385411</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL1179098</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10733666</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">569297</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">cis26006794</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Internet Archive</subfield><subfield code="b">INAR</subfield><subfield code="n">algebraiccombina0000loth</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10862046</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10866285</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10869783</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10440794</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn852898445 |
| illustrated | Illustrated |
| indexdate | 2024-10-25T16:21:30Z |
| institution | BVB |
| isbn | 9781107089556 1107089557 9781107326019 110732601X 9781107095878 1107095875 1139885685 9781139885683 1107103975 9781107103979 9780521180719 0521180716 |
| language | English |
| oclc_num | 852898445 |
| open_access_boolean | |
| owner | MAIN |
| owner_facet | MAIN |
| physical | 1 online resource (xiii, 504 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Cambridge University Press, |
| record_format | marc |
| series | Encyclopedia of mathematics and its applications ; |
| series2 | Encyclopedia of mathematics and its applications ; |
| spelling | Lothaire, M. Algebraic combinatorics on words / M. Lothaire. Cambridge ; New York : Cambridge University Press, 2002. 1 online resource (xiii, 504 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Encyclopedia of mathematics and its applications ; v. 90 Includes bibliographical references (pages 473-496) and indexes. Finite and Infinite Words -- Semigroups -- Words -- Automata -- Generating series -- Symbolic dynamical systems -- Unavoidable sets -- Sturmian Words -- Equivalent definitions -- Standard words -- Sturmian morphisms -- Unavoidable Patterns -- Definitions and basic properties -- Deciding avoidability: the Zimin algorithm -- Avoidability on a fixed alphabet -- Sesquipowers -- Bi-ideal sequences -- Canonical factorizations -- Sesquipowers and recurrence -- Extensions of a theorem of Shirshov -- Finiteness conditions for semigroups -- The Plactic Monoid -- Schensted's algorithm -- Greene's invariants and the plactic monoid -- The Robinson--Schensted--Knuth correspondence -- Schur functions and the Littlewood--Richardson rule -- Coplactic operations -- Cyclage and canonical embeddings -- Codes -- X-factorizations -- Defect -- More defect -- A theorem of Schutzenberger -- Numeration Systems -- Standard representation of numbers -- Beta-expansions -- U-representations -- Representation of complex numbers -- Periodicity -- Periods in a finite word -- Local versus global periodicity -- Infinite words -- Centralizers of Noncommutative Series and Polynomials -- Cohn's centralizer theorem -- Euclidean division and principal right ideals -- Integral closure of the centralizer -- Homomorphisms into k[t] -- Bergman's centralizer theorem -- Free subalgebras and the defect theorem -- Appendix: some commutative algebra -- Transformations on Words and q-Calculus -- The q-binomial coefficients -- The MacMahon Verfahren. Print version record. Combinatorics on words has arisen independently within several branches of mathematics, for instance number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of the area was given in Lothaire's book Combinatorics on Words. Originally published in 2002, this book presents several more topics and provides deeper insights into subjects discussed in the previous volume. An introductory chapter provides the reader with all the necessary background material. There are numerous examples, full proofs whenever possible and a notes section discussing further developments in the area. This book is both a comprehensive introduction to the subject and a valuable reference source for researchers. English. Combinatorial analysis. http://id.loc.gov/authorities/subjects/sh85028802 Word problems (Mathematics) http://id.loc.gov/authorities/subjects/sh85148106 Analyse combinatoire. Problèmes des mots (Mathématiques) MATHEMATICS Combinatorics. bisacsh Combinatorial analysis fast Word problems (Mathematics) fast Wortproblem gnd http://d-nb.info/gnd/4337256-9 Kombinatorische Analysis gnd http://d-nb.info/gnd/4164746-4 has work: Algebraic combinatorics on words (Text) https://id.oclc.org/worldcat/entity/E39PD3fDm4HcTVtJ94Y4bhpfD3 https://id.oclc.org/worldcat/ontology/hasWork Print version: Lothaire, M. Algebraic combinatorics on words. Cambridge ; New York : Cambridge University Press, 2002 0521812208 (DLC) 2001037964 (OCoLC)47297624 Encyclopedia of mathematics and its applications ; v. 90. http://id.loc.gov/authorities/names/n42010632 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=569297 Volltext CBO01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=569297 Volltext |
| spellingShingle | Lothaire, M. Algebraic combinatorics on words / Encyclopedia of mathematics and its applications ; Finite and Infinite Words -- Semigroups -- Words -- Automata -- Generating series -- Symbolic dynamical systems -- Unavoidable sets -- Sturmian Words -- Equivalent definitions -- Standard words -- Sturmian morphisms -- Unavoidable Patterns -- Definitions and basic properties -- Deciding avoidability: the Zimin algorithm -- Avoidability on a fixed alphabet -- Sesquipowers -- Bi-ideal sequences -- Canonical factorizations -- Sesquipowers and recurrence -- Extensions of a theorem of Shirshov -- Finiteness conditions for semigroups -- The Plactic Monoid -- Schensted's algorithm -- Greene's invariants and the plactic monoid -- The Robinson--Schensted--Knuth correspondence -- Schur functions and the Littlewood--Richardson rule -- Coplactic operations -- Cyclage and canonical embeddings -- Codes -- X-factorizations -- Defect -- More defect -- A theorem of Schutzenberger -- Numeration Systems -- Standard representation of numbers -- Beta-expansions -- U-representations -- Representation of complex numbers -- Periodicity -- Periods in a finite word -- Local versus global periodicity -- Infinite words -- Centralizers of Noncommutative Series and Polynomials -- Cohn's centralizer theorem -- Euclidean division and principal right ideals -- Integral closure of the centralizer -- Homomorphisms into k[t] -- Bergman's centralizer theorem -- Free subalgebras and the defect theorem -- Appendix: some commutative algebra -- Transformations on Words and q-Calculus -- The q-binomial coefficients -- The MacMahon Verfahren. Combinatorial analysis. http://id.loc.gov/authorities/subjects/sh85028802 Word problems (Mathematics) http://id.loc.gov/authorities/subjects/sh85148106 Analyse combinatoire. Problèmes des mots (Mathématiques) MATHEMATICS Combinatorics. bisacsh Combinatorial analysis fast Word problems (Mathematics) fast Wortproblem gnd http://d-nb.info/gnd/4337256-9 Kombinatorische Analysis gnd http://d-nb.info/gnd/4164746-4 |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85028802 http://id.loc.gov/authorities/subjects/sh85148106 http://d-nb.info/gnd/4337256-9 http://d-nb.info/gnd/4164746-4 |
| title | Algebraic combinatorics on words / |
| title_alt | Finite and Infinite Words -- Semigroups -- Words -- Automata -- Generating series -- Symbolic dynamical systems -- Unavoidable sets -- Sturmian Words -- Equivalent definitions -- Standard words -- Sturmian morphisms -- Unavoidable Patterns -- Definitions and basic properties -- Deciding avoidability: the Zimin algorithm -- Avoidability on a fixed alphabet -- Sesquipowers -- Bi-ideal sequences -- Canonical factorizations -- Sesquipowers and recurrence -- Extensions of a theorem of Shirshov -- Finiteness conditions for semigroups -- The Plactic Monoid -- Schensted's algorithm -- Greene's invariants and the plactic monoid -- The Robinson--Schensted--Knuth correspondence -- Schur functions and the Littlewood--Richardson rule -- Coplactic operations -- Cyclage and canonical embeddings -- Codes -- X-factorizations -- Defect -- More defect -- A theorem of Schutzenberger -- Numeration Systems -- Standard representation of numbers -- Beta-expansions -- U-representations -- Representation of complex numbers -- Periodicity -- Periods in a finite word -- Local versus global periodicity -- Infinite words -- Centralizers of Noncommutative Series and Polynomials -- Cohn's centralizer theorem -- Euclidean division and principal right ideals -- Integral closure of the centralizer -- Homomorphisms into k[t] -- Bergman's centralizer theorem -- Free subalgebras and the defect theorem -- Appendix: some commutative algebra -- Transformations on Words and q-Calculus -- The q-binomial coefficients -- The MacMahon Verfahren. |
| title_auth | Algebraic combinatorics on words / |
| title_exact_search | Algebraic combinatorics on words / |
| title_full | Algebraic combinatorics on words / M. Lothaire. |
| title_fullStr | Algebraic combinatorics on words / M. Lothaire. |
| title_full_unstemmed | Algebraic combinatorics on words / M. Lothaire. |
| title_short | Algebraic combinatorics on words / |
| title_sort | algebraic combinatorics on words |
| topic | Combinatorial analysis. http://id.loc.gov/authorities/subjects/sh85028802 Word problems (Mathematics) http://id.loc.gov/authorities/subjects/sh85148106 Analyse combinatoire. Problèmes des mots (Mathématiques) MATHEMATICS Combinatorics. bisacsh Combinatorial analysis fast Word problems (Mathematics) fast Wortproblem gnd http://d-nb.info/gnd/4337256-9 Kombinatorische Analysis gnd http://d-nb.info/gnd/4164746-4 |
| topic_facet | Combinatorial analysis. Word problems (Mathematics) Analyse combinatoire. Problèmes des mots (Mathématiques) MATHEMATICS Combinatorics. Combinatorial analysis Wortproblem Kombinatorische Analysis |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=569297 |
| work_keys_str_mv | AT lothairem algebraiccombinatoricsonwords |