The logical approach to automatic sequences: exploring combinatorics on words with walnut
Automatic sequences are sequences over a finite alphabet generated by a finite-state machine. This book presents a novel viewpoint on automatic sequences, and more generally on combinatorics on words, by introducing a decision method through which many new results in combinatorics and number theory...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2023
|
| Schriftenreihe: | London Mathematical Society lecture note series
482 |
| Schlagworte: | |
| Online-Zugang: | BSB01 BTU01 FHN01 TUM01 Volltext |
| Zusammenfassung: | Automatic sequences are sequences over a finite alphabet generated by a finite-state machine. This book presents a novel viewpoint on automatic sequences, and more generally on combinatorics on words, by introducing a decision method through which many new results in combinatorics and number theory can be automatically proved or disproved with little or no human intervention. This approach to proving theorems is extremely powerful, allowing long and error-prone case-based arguments to be replaced by simple computations. Readers will learn how to phrase their desired results in first-order logic, using free software to automate the computation process. Results that normally require multipage proofs can emerge in milliseconds, allowing users to engage with mathematical questions that would otherwise be difficult to solve. With more than 150 exercises included, this text is an ideal resource for researchers, graduate students, and advanced undergraduates studying combinatorics, sequences, and number theory |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 09 Sep 2022) |
| Beschreibung: | 1 Online-Ressource (xv, 358 Seiten) |
| ISBN: | 9781108775267 |
| DOI: | 10.1017/9781108775267 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV048537787 | ||
| 003 | DE-604 | ||
| 005 | 20221202 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 221031s2022 |||| o||u| ||||||eng d | ||
| 020 | |a 9781108775267 |c Online |9 978-1-108-77526-7 | ||
| 024 | 7 | |a 10.1017/9781108775267 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781108775267 | ||
| 035 | |a (OCoLC)1349537510 | ||
| 035 | |a (DE-599)BVBBV048537787 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 |a DE-634 |a DE-91 | ||
| 082 | 0 | |a 511.6 | |
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 100 | 1 | |a Shallit, Jeffrey O. |d 1957- |0 (DE-588)128576502 |4 aut | |
| 245 | 1 | 0 | |a The logical approach to automatic sequences |b exploring combinatorics on words with walnut |c Jeffrey Shallit |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2023 | |
| 300 | |a 1 Online-Ressource (xv, 358 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a London Mathematical Society lecture note series | |
| 490 | 0 | |a 482 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 09 Sep 2022) | ||
| 520 | |a Automatic sequences are sequences over a finite alphabet generated by a finite-state machine. This book presents a novel viewpoint on automatic sequences, and more generally on combinatorics on words, by introducing a decision method through which many new results in combinatorics and number theory can be automatically proved or disproved with little or no human intervention. This approach to proving theorems is extremely powerful, allowing long and error-prone case-based arguments to be replaced by simple computations. Readers will learn how to phrase their desired results in first-order logic, using free software to automate the computation process. Results that normally require multipage proofs can emerge in milliseconds, allowing users to engage with mathematical questions that would otherwise be difficult to solve. With more than 150 exercises included, this text is an ideal resource for researchers, graduate students, and advanced undergraduates studying combinatorics, sequences, and number theory | ||
| 650 | 4 | |a Combinatorial analysis / Data processing | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-108-74524-6 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/9781108775267 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-033914353 | ||
| 966 | e | |u https://doi.org/10.1017/9781108775267 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108775267 |l BTU01 |p ZDB-20-CBO |q BTU_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108775267 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108775267 |l TUM01 |p ZDB-20-CBO |q TUM_Paketkauf_2022 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804184536285708288 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Shallit, Jeffrey O. 1957- |
| author_GND | (DE-588)128576502 |
| author_facet | Shallit, Jeffrey O. 1957- |
| author_role | aut |
| author_sort | Shallit, Jeffrey O. 1957- |
| author_variant | j o s jo jos |
| building | Verbundindex |
| bvnumber | BV048537787 |
| classification_rvk | SK 170 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9781108775267 (OCoLC)1349537510 (DE-599)BVBBV048537787 |
| 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.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| discipline_str_mv | Mathematik |
| doi_str_mv | 10.1017/9781108775267 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02891nmm a2200445zc 4500</leader><controlfield tag="001">BV048537787</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20221202 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">221031s2022 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108775267</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-108-77526-7</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/9781108775267</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781108775267</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1349537510</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV048537787</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><subfield code="a">DE-634</subfield><subfield code="a">DE-91</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.6</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">Shallit, Jeffrey O.</subfield><subfield code="d">1957-</subfield><subfield code="0">(DE-588)128576502</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The logical approach to automatic sequences</subfield><subfield code="b">exploring combinatorics on words with walnut</subfield><subfield code="c">Jeffrey Shallit</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2023</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xv, 358 Seiten)</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">London Mathematical Society lecture note series</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">482</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 09 Sep 2022)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Automatic sequences are sequences over a finite alphabet generated by a finite-state machine. This book presents a novel viewpoint on automatic sequences, and more generally on combinatorics on words, by introducing a decision method through which many new results in combinatorics and number theory can be automatically proved or disproved with little or no human intervention. This approach to proving theorems is extremely powerful, allowing long and error-prone case-based arguments to be replaced by simple computations. Readers will learn how to phrase their desired results in first-order logic, using free software to automate the computation process. Results that normally require multipage proofs can emerge in milliseconds, allowing users to engage with mathematical questions that would otherwise be difficult to solve. With more than 150 exercises included, this text is an ideal resource for researchers, graduate students, and advanced undergraduates studying combinatorics, sequences, and number theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial analysis / Data processing</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-1-108-74524-6</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/9781108775267</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-033914353</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108775267</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/9781108775267</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BTU_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/9781108775267</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><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108775267</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">TUM_Paketkauf_2022</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV048537787 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T20:54:32Z |
| indexdate | 2024-07-10T09:40:54Z |
| institution | BVB |
| isbn | 9781108775267 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-033914353 |
| oclc_num | 1349537510 |
| open_access_boolean | |
| owner | DE-12 DE-92 DE-634 DE-91 DE-BY-TUM |
| owner_facet | DE-12 DE-92 DE-634 DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xv, 358 Seiten) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO BTU_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-20-CBO TUM_Paketkauf_2022 |
| publishDate | 2023 |
| publishDateSearch | 2022 |
| publishDateSort | 2022 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | London Mathematical Society lecture note series 482 |
| spelling | Shallit, Jeffrey O. 1957- (DE-588)128576502 aut The logical approach to automatic sequences exploring combinatorics on words with walnut Jeffrey Shallit Cambridge Cambridge University Press 2023 1 Online-Ressource (xv, 358 Seiten) txt rdacontent c rdamedia cr rdacarrier London Mathematical Society lecture note series 482 Title from publisher's bibliographic system (viewed on 09 Sep 2022) Automatic sequences are sequences over a finite alphabet generated by a finite-state machine. This book presents a novel viewpoint on automatic sequences, and more generally on combinatorics on words, by introducing a decision method through which many new results in combinatorics and number theory can be automatically proved or disproved with little or no human intervention. This approach to proving theorems is extremely powerful, allowing long and error-prone case-based arguments to be replaced by simple computations. Readers will learn how to phrase their desired results in first-order logic, using free software to automate the computation process. Results that normally require multipage proofs can emerge in milliseconds, allowing users to engage with mathematical questions that would otherwise be difficult to solve. With more than 150 exercises included, this text is an ideal resource for researchers, graduate students, and advanced undergraduates studying combinatorics, sequences, and number theory Combinatorial analysis / Data processing Erscheint auch als Druck-Ausgabe 978-1-108-74524-6 https://doi.org/10.1017/9781108775267 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Shallit, Jeffrey O. 1957- The logical approach to automatic sequences exploring combinatorics on words with walnut Combinatorial analysis / Data processing |
| title | The logical approach to automatic sequences exploring combinatorics on words with walnut |
| title_auth | The logical approach to automatic sequences exploring combinatorics on words with walnut |
| title_exact_search | The logical approach to automatic sequences exploring combinatorics on words with walnut |
| title_exact_search_txtP | The logical approach to automatic sequences exploring combinatorics on words with walnut |
| title_full | The logical approach to automatic sequences exploring combinatorics on words with walnut Jeffrey Shallit |
| title_fullStr | The logical approach to automatic sequences exploring combinatorics on words with walnut Jeffrey Shallit |
| title_full_unstemmed | The logical approach to automatic sequences exploring combinatorics on words with walnut Jeffrey Shallit |
| title_short | The logical approach to automatic sequences |
| title_sort | the logical approach to automatic sequences exploring combinatorics on words with walnut |
| title_sub | exploring combinatorics on words with walnut |
| topic | Combinatorial analysis / Data processing |
| topic_facet | Combinatorial analysis / Data processing |
| url | https://doi.org/10.1017/9781108775267 |
| work_keys_str_mv | AT shallitjeffreyo thelogicalapproachtoautomaticsequencesexploringcombinatoricsonwordswithwalnut |