Nous lisons an introduction to Symbolic Dynamics and Coding de D. Lind et B. Marcus à la vitesse d'un chapitre par séance. L'un d'entre nous étudie le chapitre du jour et le présente aux autres.
Chapter 1. SHIFT SPACES §1.1. Full Shifts §1.2. Shift Spaces §1.3. Languages §1.4. Higher Block Shifts and Higher Power Shifts §1.5. Sliding Block Codes §1.6. Convolutional Encoders
Chapter 2. SHIFTS OF FINITE TYPE §2.1. Finite Type Constraints §2.2. Graphs and Their Shifts §2.3. Graph Representations of Shifts of Finite Type §2.4. State Splitting §2.5. Data Storage and Shifts of Finite Type
Chapter 3. SOFIC SHIFTS §3.1. Presentations of Sofic Shifts §3.2. Characterizations of Sofic Shifts §3.3. Minimal Right-Resolving Presentations §3.4. Constructions and Algorithms
Chapter 4. ENTROPY §4.1. Definition and Basic Properties §4.2. Perron-Frobenius Theory §4.3. Computing Entropy §4.4. Irreducible Components §4.5. Cyclic Structure
Chapter 5. FINITE-STATE CODES §5.1. Road Colorings and Right-Closing Labelings §5.2. Finite-State Codes §5.3. Approximate Eigenvectors §5.4. Code Construction §5.5. Sliding Block Decoders
Chapter 6. SHIFTS AS DYNAMICAL SYSTEMS §6.1. Metric Spaces §6.2. Dynamical Systems §6.3. Invariants §6.4. Zeta Functions §6.5. Markov Partitions
(...)