Sequences, Groups, and Number Theory
Springer International Publishing (Verlag)
978-3-319-69151-0 (ISBN)
This volume is intended for use by graduate students or research mathematicians, as well as computer scientists who are working in automata theory and formal language theory. With its organization around unified themes, it would also be appropriate as a supplemental text for graduate level courses.
Valérie Berthé is a researcher at the Institut de Recherche en Informatique Fondamentale, which is a joint project between the Centre National del Recherche Scientifique and the University Paris-Diderot. Michel Rigo is a professor in the Unité de Mathématiques Discrétes at the Université de Liége.
General Framework.- Number Theoretic Aspects of Regular Sequences.- First-order Logic and Numeration System.- Some Applications of Algebra to Automatic Sequences.- Avoiding or Limiting Regularities in Words.- Coloring Problems for Infinite Words.- Normal Numbers and Computer Science.- Normal Numbers and Symbolic Dynamics.- About the Domino Problem for Subshifts on Groups.- Automation (Semi)Groups: Wang Tilings and Schreier Tries.- Amenability of Groups and G-Sets.- Index.- References.
Erscheinungsdatum | 20.03.2018 |
---|---|
Reihe/Serie | Trends in Mathematics |
Zusatzinfo | XXVI, 578 p. 87 illus., 15 illus. in color. |
Verlagsort | Cham |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 1018 g |
Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
Schlagworte | Amenable groups • Automata • automatic sequences • combinatorics • combinatorics & graph theory • Combinatorics & graph theory • discrete dynamical systems • Discrete Mathematics • Discrete mathematics in computer science • Group of automata • Groups & group theory • Groups & group theory • Group Theory and Generalizations • Mathematics • mathematics and statistics • Maths for computer scientists • Normal numbers • Number Theory • numeration systems • symbolic dynamics • Tilings • Word combinatorics |
ISBN-10 | 3-319-69151-1 / 3319691511 |
ISBN-13 | 978-3-319-69151-0 / 9783319691510 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich