Automatic sequences : theory, applications, generalizations /

Uniting dozens of seemingly disparate results from different fields, this book combines concepts from mathematics and computer science to present the first integrated treatment of sequences generated by 'finite automata'. The authors apply the theory to the study of automatic sequences and...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Allouche, Jean-Paul, 1953-
Otros Autores: Shallit, Jeffrey Outlaw
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cambridge ; New York : Cambridge University Press, 2003.
Temas:
Sequential machine theory.
Sequences (Mathematics)
Théorie des machines séquentielles.
Suites (Mathématiques)
MATHEMATICS > Infinity.
Sequential machine theory
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Cover
  • Half-title
  • Title
  • Copyright
  • Dedication
  • Contents
  • Preface
  • Goals of This Book
  • Prerequisites
  • Algorithm Descriptions
  • Acknowledgments
  • 1 Stringology
  • 1.1 Alpha Words
  • 1.2 Topology and Measure
  • 1.3 Languages and Regular Expressions
  • 1.4 Morphisms
  • 1.5 The Theorems of Lyndon and Schützenberger
  • 1.6 Repetitions in Words
  • 1.7 Overlap-Free Binary Words
  • 1.8 Additional Topics on Repetitions
  • 1.9 Exercises
  • 1.10 Open Problems
  • 1.11 Notes on Chapter 1
  • 2 Number Theory and Algebra
  • 2.1 Divisibility and Valuations.
  • 2.2 Rational and Irrational Numbers
  • 2.3 Algebraic and Transcendental Numbers
  • 2.4 Continued Fractions
  • 2.5 Basics of Diophantine Approximation
  • 2.6 The Three-Distance Theorem
  • 2.7 Algebraic Structures
  • 2.8 Vector Spaces
  • 2.9 Fields
  • 2.10 Polynomials, Rational Functions, and Formal Power Series
  • 2.11 Rho-adic Numbers
  • 2.12 Asymptotic Notation
  • 2.13 Some Useful Estimates
  • 2.14 Exercises
  • 2.15 Open Problems
  • 2.16 Notes on Chapter 2
  • 3 Numeration Systems
  • 3.1 Numeration Systems
  • 3.2 Sums of Digits
  • 3.3 Block Counting and Digital Sequences.
  • 3.4 Representation of Real Numbers
  • 3.5 Sums of Sums of Digits
  • 3.6 Base-k Representation with Alternate Digit Sets
  • 3.7 Representations in Negative Bases
  • 3.8 Fibonacci Representation
  • 3.9 Ostrowski's Alpha-Numeration System
  • 3.10 Representations in Complex Bases
  • 3.11 Exercises
  • 3.12 Open Problems
  • 3.13 Notes on Chapter 3
  • 4 Finite Automata and Other Models of Computation
  • 4.1 Finite Automata
  • 4.2 Proving Languages Nonregular
  • 4.3 Finite Automata with Output
  • 4.4 Context-Free Grammars and Languages
  • 4.5 Context-Sensitive Grammars and Languages.
  • 4.6 Turing Machines
  • 4.7 Exercises
  • 4.8 Open Problems
  • 4.9 Notes on Chapter 4
  • 5 Automatic Sequences
  • 5.1 Automatic Sequences
  • 5.2 Robustness of the Automatic Sequence Concept
  • 5.3 Two-Sided Automatic Sequences
  • 5.4 Basic Properties of Automatic Sequences
  • 5.5 Nonautomatic Sequences
  • 5.6 Kappa-Automatic Sets
  • 5.7 1-Automatic Sequences
  • 5.8 Exercises
  • 5.9 Open Problems
  • 5.10 Notes on Chapter 5
  • 6 Uniform Morphisms and Automatic Sequences
  • 6.1 Fixed Points of Uniform Morphisms
  • 6.2 The Thue-Morse Infinite Word
  • 6.3 Cobham's Theorem.
  • 6.4 The Tower of Hanoi and Iterated Morphisms
  • 6.5 Paperfolding and Continued Fractions
  • 6.6 The Kappa-Kernel
  • 6.7 Cobham's Theorem for (Kappa, lota)-Numeration Systems
  • 6.8 Basic Closure Properties
  • 6.9 Uniform Transduction of Automatic Sequences
  • 6.10 Sums of Digits, Polynomials, and Automatic Sequences
  • 6.11 Exercises
  • 6.12 Open Problems
  • 6.13 Notes on Chapter 6
  • 7 Morphic Sequences
  • 7.1 The Infinite Fibonacci Word
  • 7.2 Finite Fixed Points
  • 7.3 Morphic Sequences and Infinite Fixed Points
  • 7.4 Two-Sided Infinite Fixed Points
  • 7.5 More on Infinite Fixed Points.

Ejemplares similares