Formal languages, automata and numeration systems, 2, Applications to recognizability and decidability:
The interplay between words, computability, algebra and arithmetic has now proved its relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite automata (such as that initiated by J.R. Büchi) or between combinatorics on words and number theory has paved the way to...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
London
ISTE Ltd
2014
|
| Series: | Networks and telecommunications series
|
| Subjects: | |
| Online Access: | FRO01 UBG01 Volltext |
| Summary: | The interplay between words, computability, algebra and arithmetic has now proved its relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite automata (such as that initiated by J.R. Büchi) or between combinatorics on words and number theory has paved the way to recent dramatic developments, for example, the transcendence results for the real numbers having a "simple" binary expansion, by B. Adamczewski and Y. Bugeaud. This book is at the heart of this interplay through a unified exposition. Objects are considered with a perspective that comes both from t |
| Item Description: | Includes bibliographical references and index |
| Physical Description: | 1 online resource (xix, 234 pages .) |
| ISBN: | 9781119042952 9781119042853 |
Staff View
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV044725253 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 180122s2014 |||| o||u| ||||||eng d | ||
| 020 | |a 9781119042952 |9 9781119042952 | ||
| 020 | |a 9781119042853 |9 9781119042853 | ||
| 024 | 7 | |a 10.1002/9781119042853 |2 doi | |
| 035 | |a (OCoLC)1020568868 | ||
| 035 | |a (DE-599)BVBBV044725253 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-861 | ||
| 082 | 0 | |a 005.13/1 | |
| 100 | 1 | |a Rigo, Michel |d 1975- |e Verfasser |0 (DE-588)1099989027 |4 aut | |
| 245 | 1 | 0 | |a Formal languages, automata and numeration systems, 2, Applications to recognizability and decidability |c Michel Rigo |
| 246 | 1 | 3 | |a Applications to recognizability and decidability |
| 264 | 1 | |a London |b ISTE Ltd |c 2014 | |
| 300 | |a 1 online resource (xix, 234 pages .) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Networks and telecommunications series | |
| 500 | |a Includes bibliographical references and index | ||
| 520 | |a The interplay between words, computability, algebra and arithmetic has now proved its relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite automata (such as that initiated by J.R. Büchi) or between combinatorics on words and number theory has paved the way to recent dramatic developments, for example, the transcendence results for the real numbers having a "simple" binary expansion, by B. Adamczewski and Y. Bugeaud. This book is at the heart of this interplay through a unified exposition. Objects are considered with a perspective that comes both from t | ||
| 650 | 4 | |a REFERENCE / Questions & Answers / bisacsh | |
| 650 | 4 | |a Computer programming / fast / (OCoLC)fst00872390 | |
| 650 | 4 | |a Machine theory / fast / (OCoLC)fst01004846 | |
| 650 | 4 | |a Machine theory | |
| 650 | 4 | |a Computer programming | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781848217881 |
| 856 | 4 | 0 | |u https://onlinelibrary.wiley.com/doi/book/10.1002/9781119042853 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-35-WIC | ||
| 940 | 1 | |q UBG_PDA_WIC | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030121430 | ||
| 966 | e | |u https://onlinelibrary.wiley.com/doi/book/10.1002/9781119042853 |l FRO01 |p ZDB-35-WIC |q FRO_PDA_WIC |x Verlag |3 Volltext | |
| 966 | e | |u https://onlinelibrary.wiley.com/doi/book/10.1002/9781119042853 |l UBG01 |p ZDB-35-WIC |q UBG_PDA_WIC |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1804178216167931904 |
|---|---|
| any_adam_object | |
| author | Rigo, Michel 1975- |
| author_GND | (DE-588)1099989027 |
| author_facet | Rigo, Michel 1975- |
| author_role | aut |
| author_sort | Rigo, Michel 1975- |
| author_variant | m r mr |
| building | Verbundindex |
| bvnumber | BV044725253 |
| collection | ZDB-35-WIC |
| ctrlnum | (OCoLC)1020568868 (DE-599)BVBBV044725253 |
| dewey-full | 005.13/1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.13/1 |
| dewey-search | 005.13/1 |
| dewey-sort | 15.13 11 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02479nmm a2200469zc 4500</leader><controlfield tag="001">BV044725253</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">180122s2014 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781119042952</subfield><subfield code="9">9781119042952</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781119042853</subfield><subfield code="9">9781119042853</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1002/9781119042853</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1020568868</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044725253</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-861</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13/1</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rigo, Michel</subfield><subfield code="d">1975-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1099989027</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Formal languages, automata and numeration systems, 2, Applications to recognizability and decidability</subfield><subfield code="c">Michel Rigo</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Applications to recognizability and decidability</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London</subfield><subfield code="b">ISTE Ltd</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xix, 234 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">Networks and telecommunications series</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The interplay between words, computability, algebra and arithmetic has now proved its relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite automata (such as that initiated by J.R. Büchi) or between combinatorics on words and number theory has paved the way to recent dramatic developments, for example, the transcendence results for the real numbers having a "simple" binary expansion, by B. Adamczewski and Y. Bugeaud. This book is at the heart of this interplay through a unified exposition. Objects are considered with a perspective that comes both from t</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">REFERENCE / Questions & Answers / bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming / fast / (OCoLC)fst00872390</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory / fast / (OCoLC)fst01004846</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</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">9781848217881</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://onlinelibrary.wiley.com/doi/book/10.1002/9781119042853</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-35-WIC</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">UBG_PDA_WIC</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030121430</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://onlinelibrary.wiley.com/doi/book/10.1002/9781119042853</subfield><subfield code="l">FRO01</subfield><subfield code="p">ZDB-35-WIC</subfield><subfield code="q">FRO_PDA_WIC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://onlinelibrary.wiley.com/doi/book/10.1002/9781119042853</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-35-WIC</subfield><subfield code="q">UBG_PDA_WIC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV044725253 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:00:26Z |
| institution | BVB |
| isbn | 9781119042952 9781119042853 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030121430 |
| oclc_num | 1020568868 |
| open_access_boolean | |
| owner | DE-861 |
| owner_facet | DE-861 |
| physical | 1 online resource (xix, 234 pages .) |
| psigel | ZDB-35-WIC UBG_PDA_WIC ZDB-35-WIC FRO_PDA_WIC ZDB-35-WIC UBG_PDA_WIC |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | ISTE Ltd |
| record_format | marc |
| series2 | Networks and telecommunications series |
| spelling | Rigo, Michel 1975- Verfasser (DE-588)1099989027 aut Formal languages, automata and numeration systems, 2, Applications to recognizability and decidability Michel Rigo Applications to recognizability and decidability London ISTE Ltd 2014 1 online resource (xix, 234 pages .) txt rdacontent c rdamedia cr rdacarrier Networks and telecommunications series Includes bibliographical references and index The interplay between words, computability, algebra and arithmetic has now proved its relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite automata (such as that initiated by J.R. Büchi) or between combinatorics on words and number theory has paved the way to recent dramatic developments, for example, the transcendence results for the real numbers having a "simple" binary expansion, by B. Adamczewski and Y. Bugeaud. This book is at the heart of this interplay through a unified exposition. Objects are considered with a perspective that comes both from t REFERENCE / Questions & Answers / bisacsh Computer programming / fast / (OCoLC)fst00872390 Machine theory / fast / (OCoLC)fst01004846 Machine theory Computer programming Erscheint auch als Druck-Ausgabe 9781848217881 https://onlinelibrary.wiley.com/doi/book/10.1002/9781119042853 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Rigo, Michel 1975- Formal languages, automata and numeration systems, 2, Applications to recognizability and decidability REFERENCE / Questions & Answers / bisacsh Computer programming / fast / (OCoLC)fst00872390 Machine theory / fast / (OCoLC)fst01004846 Machine theory Computer programming |
| title | Formal languages, automata and numeration systems, 2, Applications to recognizability and decidability |
| title_alt | Applications to recognizability and decidability |
| title_auth | Formal languages, automata and numeration systems, 2, Applications to recognizability and decidability |
| title_exact_search | Formal languages, automata and numeration systems, 2, Applications to recognizability and decidability |
| title_full | Formal languages, automata and numeration systems, 2, Applications to recognizability and decidability Michel Rigo |
| title_fullStr | Formal languages, automata and numeration systems, 2, Applications to recognizability and decidability Michel Rigo |
| title_full_unstemmed | Formal languages, automata and numeration systems, 2, Applications to recognizability and decidability Michel Rigo |
| title_short | Formal languages, automata and numeration systems, 2, Applications to recognizability and decidability |
| title_sort | formal languages automata and numeration systems 2 applications to recognizability and decidability |
| topic | REFERENCE / Questions & Answers / bisacsh Computer programming / fast / (OCoLC)fst00872390 Machine theory / fast / (OCoLC)fst01004846 Machine theory Computer programming |
| topic_facet | REFERENCE / Questions & Answers / bisacsh Computer programming / fast / (OCoLC)fst00872390 Machine theory / fast / (OCoLC)fst01004846 Machine theory Computer programming |
| url | https://onlinelibrary.wiley.com/doi/book/10.1002/9781119042853 |
| work_keys_str_mv | AT rigomichel formallanguagesautomataandnumerationsystems2applicationstorecognizabilityanddecidability AT rigomichel applicationstorecognizabilityanddecidability |