Berthe / Berthé / Rigo | Combinatorics, Automata and Number Theory | Buch | 978-0-521-51597-9 | www.sack.de

Buch, Englisch, Band 135, 636 Seiten, Format (B × H): 161 mm x 240 mm, Gewicht: 1109 g

Reihe: Encyclopedia of Mathematics and its Applications

Berthe / Berthé / Rigo

Combinatorics, Automata and Number Theory


Erscheinungsjahr 2011
ISBN: 978-0-521-51597-9
Verlag: Cambridge University Press

Buch, Englisch, Band 135, 636 Seiten, Format (B × H): 161 mm x 240 mm, Gewicht: 1109 g

Reihe: Encyclopedia of Mathematics and its Applications

ISBN: 978-0-521-51597-9
Verlag: Cambridge University Press


• Provides a useful overview of the most recent results
• Written for readers with either a mathematical or computer science background
• Chapters are self-contained so readers do not have to consult extra material
This collaborative volume presents recent trends arising from the fruitful interaction between the themes of combinatorics on words, automata and formal language theory, and number theory. Presenting several important tools and concepts, the authors also reveal some of the exciting and important relationships that exist between these different fields. Topics include numeration systems, word complexity function, morphic words, Rauzy tilings and substitutive dynamical systems, Bratelli diagrams, frequencies and ergodicity, Diophantine approximation and transcendence, asymptotic properties of digital functions, decidability issues for D0L systems, matrix products and joint spectral radius. Topics are presented in a way that links them to the three main themes, but also extends them to dynamical systems and ergodic theory, fractals, tilings and spectral properties of matrices. Graduate students, research mathematicians and computer scientists working in combinatorics, theory of computation, number theory, symbolic dynamics, fractals, tilings and stringology will find much of interest in this book.

Berthe / Berthé / Rigo Combinatorics, Automata and Number Theory jetzt bestellen!

Weitere Infos & Material


Introduction Valérie Berthé and Michel Rigo
1. Preliminaries
2. Number representation and finite automata Ch. Frougny and J. Sakarovitch
3. Abstract numeration systems P. Lecomte and M. Rigo
4. Factor complexity J. Cassaigne and F. Nicolas
5. Substitutions, Rauzy fractals, and tilings V. Berthé, A. Siegel and J. Thuswaldner
6. Combinatorics on Bratelli diagrams and dynamical systems F. Durand
7. Infinite words with uniform frequencies, and invariant measures S. Ferenczi and T. Monteil
8. Transcendence and Diophantine approximation B. Adamczewski and Y. Bugeaud
9. Analysis of digital functions and applications M. Drmota and P. Grabner
10. The equality problem for purely substitutive words J. Honkala
11. Long products of matrices V. Blondel and R. Jungers
References
Notation index
General index.
Introduction Valérie Berthé and Michel Rigo; 1. Preliminaries; 2. Number representation and finite automata Ch. Frougny and J. Sakarovitch; 3. Abstract numeration systems P. Lecomte and M. Rigo; 4. Factor complexity J. Cassaigne and F. Nicolas; 5. Substitutions, Rauzy fractals, and tilings V. Berthé, A. Siegel and J. Thuswaldner; 6. Combinatorics on Bratelli diagrams and dynamical systems F. Durand; 7. Infinite words with uniform frequencies, and invariant measures S. Ferenczi and T. Monteil; 8. Transcendence and Diophantine approximation B. Adamczewski and Y. Bugeaud; 9. Analysis of digital functions and applications M. Drmota and P. Grabner; 10. The equality problem for purely substitutive words J. Honkala; 11. Long products of matrices V. Blondel and R. Jungers; References; Notation index; General index.


Rigo, Michel
Michel Rigo is a Professor in the Department of Mathematics at the University of Liège, Belgium.

Berthé, Valérie
Valérie Berthé is 'Directeur de Recherche CNRS' in the Montpellier Laboratory of Informatics, Robotics, and Micro-electronics (LIRMM) at the University of Montpellier 2, France.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.