An Introduction to Symbolic Dynamics and Coding
From MaRDI portal
Publication:4856597
DOI10.1017/CBO9780511626302zbMATH Open1106.37301OpenAlexW4206252072MaRDI QIDQ4856597FDOQ4856597
Authors: Brian Marcus, Douglas Lind 
Publication date: 30 November 1995
Full work available at URL: https://doi.org/10.1017/cbo9780511626302
Recommendations
entropiesshifts of finite typesofic shiftsfinite equivalencePerron-Frobenius theory of nonnegative matricesalmost conjugacyFinite-State Coding Theoremstate-splitting algorithm for code constructionzeta functions of shifts of finite type
Coding theorems (Shannon theory) (94A24) Positive matrices and their generalizations; cones of matrices (15B48) Symbolic dynamics (37B10) Topological entropy (37B40) Other types of codes (94B60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to dynamical systems and ergodic theory (37-01)
Cited In (only showing first 100 items - show all)
- Cellular automata between sofic tree shifts
- Turing degrees of multidimensional SFTs
- Mass problems associated with effectively closed sets
- A suspension flow over the full shift with two distinct measures of maximal entropy
- UNAVOIDABLE SETS OF CONSTANT LENGTH
- Category equivalences involving graded modules over path algebras of quivers.
- Symbolic dynamics and synchronization of coupled map networks with multiple delays
- Realization of aperiodic subshifts and uniform densities in groups
- \((M + 1)\)-step shift spaces that are not conjugate to \(M\)-step shift spaces
- Computing the topological entropy of shifts
- Beta-expansions, natural extensions and multiple tilings associated with Pisot units
- On the uncontrollability of nonabelian group codes with uncoded group \(\mathbb Z_p\)
- Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions
- Numeration and discrete dynamical systems
- Presentations of Schützenberger groups of minimal subshifts.
- A Lebesgue-like measure for inverse limit spaces of piecewise strictly monotone maps of an interval
- Parageometric outer automorphisms of free groups
- Abelian closures of infinite binary words
- Measures of maximal entropy for suspension flows over the full shift
- Full groups of one-sided topological Markov shifts
- An inner product space on irreducible and synchronizable probabilistic finite state automata
- Computation of symbolic dynamics for one-dimensional maps
- Topological and symbolic dynamics for hyperbolic systems with holes
- Quantum cognition and bounded rationality
- Classification of Cuntz-Krieger algebras by orbit equivalence of topological Markov shifts
- Symbolic dynamics, coarse graining and the monitoring of complex systems
- Topological dynamics of the Weil-Petersson geodesic flow
- Reducibility of covers of AFT shifts
- Tree-shifts of finite type
- Division point measures resulting from triangle subdivisions
- Statistical mechanics of complex systems for pattern identification
- $\it \Pi^0_1$ Sets and Tilings
- Effective symbolic dynamics
- Semi-strongly irreducible shifts
- Growth-sensitivity of context-free languages.
- Automorphisms of the shift: Lyapunov exponents, entropy, and the dimension representation
- Modelling programmed frameshifting with frameshift machines
- Vector space formulation of probabilistic finite state automata
- Topological conjugacy on the complement of the periodic points
- Extremal minimality conditions on automata
- Integrality for TQFTs
- Wavelet-based feature extraction using probabilistic finite state automata for pattern classification
- A gauge invariant uniqueness theorem for corners of higher rank graph algebras
- On the undecidability of the limit behavior of cellular automata
- Combinatorial properties of smooth infinite words
- A hierarchy of shift equivalent sofic shifts
- Invariant measures for the subshifts arising from non-primitive substitutions
- The spectra of lamplighter groups and Cayley machines.
- Topological entropy for the canonical completely positive maps on graph C*-Algebras
- A groupoid approach toC*-algebras associated withλ-graph systems and continuous orbit equivalence of subshifts
- A method for fast timer coding of texts
- Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words
- On the entropy of regular languages.
- On Boolean control networks with maximal topological entropy
- On the Fibonacci-Mandelbrot set
- Realization problems for nonuniform cellular automata
- Three research directions in non-uniform cellular automata
- Topological and ergodic properties of symmetric sub-shifts
- The structure of limit sets for \(\mathbb{Z}^d\) actions
- Spectral Decomposition Theorem for non-hyperbolic maps
- Volume and entropy of regular timed languages: analytic approach
- Framed Versus Unframed Two-Dimensional Languages
- Pattern closure of groups of tree automorphisms.
- Parallel addition in non-standard numeration systems
- Variable time step dynamics with choice
- Category theory of symbolic dynamics
- The waiting spectra of the sets described by the quantitative waiting time indicators
- Numeration systems and Markov partitions from self similar tilings
- Computable symbolic dynamics
- Equilibrium states for factor maps between subshifts
- Growth and ergodicity of context-free languages
- An Ihara formula for partially directed graphs
- Uniform and Bernoulli measures on the boundary of trace monoids
- Hardness of conjugacy, embedding and factorization of multidimensional subshifts
- Growth and ergodicity of context-free languages II: The linear case
- Two-by-Two Substitution Systems and the Undecidability of the Domino Problem
- Weak equivalence for shifts of finite type
- Applications of automata and graphs: Labeling-operators in Hilbert space. I
- On Negative Bases
- Data compression and learning in time sequences analysis
- The entropy of graded algebras
- A characterization of \(\omega \)-limit sets in shift spaces
- Moment computations for graphs with fractal property
- Non-normal numbers with respect to Markov partitions
- On-line finite automata for addition in some numeration systems
- Prefix-suffix automaton associated with a primitive substitution
- Approximate verification of the symbolic dynamics of Markov chains
- SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS
- THE SYNTACTIC GRAPH OF A SOFIC SHIFT IS INVARIANT UNDER SHIFT EQUIVALENCE
- CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY
- Spanning tree invariants, loop systems and doubly stochastic matrices
- On the structure of a sofic shift space
- A characterization of cellular automata generated by idempotents on the full shift
- Computations on sofic \(S\)-gap shifts
- Subshifts as models for MSO logic
- Symbolic synchronization and the detection of global properties of coupled dynamics from local information
- Dynamics and topology of \(S\)-gap shifts
- On the automorphism groups of multidimensional shifts of finite type
- The road coloring problem
- The mapping class group of a shift of finite type
This page was built for publication: An Introduction to Symbolic Dynamics and Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4856597)
