Combinatorics, Automata and Number Theory
eBook - PDF

Combinatorics, Automata and Number Theory

  1. English
  2. PDF
  3. Available on iOS & Android
eBook - PDF

Combinatorics, Automata and Number Theory

About this book

This collaborative volume presents 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.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Combinatorics, Automata and Number Theory by Valérie Berthé,Michel Rigo in PDF and/or ePUB format, as well as other popular books in Mathematics & Discrete Mathematics. We have over one million books available in our catalogue for you to explore.

Table of contents

  1. Cover
  2. Title Page
  3. Copyright
  4. Contents
  5. List of contributors
  6. Preface
  7. Acknowledgements
  8. 1 Preliminaries: V. Berthé, M. Rigo
  9. 2 Number representation and finite automata: Ch. Frougny, J. Sakarovitch
  10. 3 Abstract numeration systems: P. Lecomte, M. Rigo
  11. 4 Factor complexity: J. Cassaigne, F. Nicolas
  12. 5 Substitutions, Rauzy fractals and tilings: V. Berthé, A. Siegel, J. Thuswaldner
  13. 6 Combinatorics on Bratteli diagrams and dynamical systems: F. Durand
  14. 7 Infinite words with uniform frequencies, and invariant measures: S. Ferenczi, T. Monteil
  15. 8 Transcendence and Diophantine approximation: B. Adamczewski, Y. Bugeaud
  16. 9 Analysis of digital functions and applications: M. Drmota, P. J. Grabner
  17. 10 The equality problem for purely substitutive words: J. Honkala
  18. 11 Long products of matrices: V. D. Blondel, R. M. Jungers
  19. References
  20. Notation index
  21. General index