An Introduction to Symbolic Dynamics and Coding

DOI10.1017/CBO9780511626302zbMath1106.37301OpenAlexW4206252072MaRDI QIDQ4856597

Brian Marcus, Douglas Lind

Publication date: 30 November 1995

Full work available at URL: https://doi.org/10.1017/cbo9780511626302

zbMATH Keywords

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

Mathematics Subject Classification ID

Related Items (only showing first 100 items - show all)

Cellular automata and strongly irreducible shifts of finite type. ⋮ A cellular automata model of Ebola virus dynamics ⋮ A characterization of the sets of periods within shifts of finite type ⋮ Set of periods of a subshift ⋮ Markov-Dyck shifts, neutral periodic points and topological conjugacy ⋮ Double minimality, entropy and disjointness with all minimal systems ⋮ Topological entropy of a class of subshifts of finite type ⋮ Inverse semigroup shifts over countable alphabets ⋮ Flow equivalence of sofic shifts ⋮ Topological rigidity of linear cellular automaton shifts ⋮ Dynamical systems arising from random substitutions ⋮ Upper bounds on the growth rates of independent sets in two dimensions via corner transfer matrices ⋮ On dynamical complexity of surjective ultimately right-expansive cellular automata ⋮ Glider automorphisms on some shifts of finite type and a finitary Ryan's theorem ⋮ Tree shift topological entropy ⋮ Dynamics in dimension zero A survey ⋮ Self-induced systems ⋮ Deformation rate of boundaries in Anosov and related systems ⋮ Univoque bases and Hausdorff dimension ⋮ Decompositions of factor maps involving bi-closing maps ⋮ Topological conjugacy of topological Markov shifts and Cuntz-Krieger algebras ⋮ Reversing and extended symmetries of shift spaces ⋮ Spectrally Perron polynomials and the Cauchy-Ostrovsky theorem ⋮ Lifting covers of sofic shifts ⋮ Nonhyperbolic step skew-products: ergodic approximation ⋮ Computing generalized de Bruijn sequences ⋮ Corrigendum to: ``Syndetically proximal pairs ⋮ Slow continued fractions, transducers, and the Serret theorem ⋮ Seas of squares with sizes from a \(\Pi_{1}^{0}\) set ⋮ Asymptotic orbits of primitive substitutions ⋮ On viewing block codes as finite automata. ⋮ The size of power automata. ⋮ Number conserving cellular automata. II: Dynamics. ⋮ Combinatorial constructions associated to the dynamics of one-sided cellular automata. ⋮ Convex subshifts, separated Bratteli diagrams, and ideal structure of tame separated graph algebras ⋮ An approach to solving \(A^{k}=J-I\) ⋮ Spectra of Schreier graphs of Grigorchuk's group and Schroedinger operators with aperiodic order ⋮ The mapping class group of a shift of finite type ⋮ Distortion and the automorphism group of a shift ⋮ Decomposition of infinite-to-one factor codes and uniqueness of relative equilibrium states ⋮ Nonsingular dynamical systems, Bratteli diagrams and Markov odometers ⋮ On the entropy of regular languages. ⋮ Growth-sensitivity of context-free languages. ⋮ Dynamics from multivariable longitudinal data ⋮ Asymptotic combinatorics of Artin-Tits monoids and of some other monoids ⋮ Realization of aperiodic subshifts and uniform densities in groups ⋮ Projections of Gibbs states for Hölder potentials ⋮ Invariant sets for QMF functions ⋮ \((M + 1)\)-step shift spaces that are not conjugate to \(M\)-step shift spaces ⋮ Every Borel automorphism without finite invariant measures admits a two-set generator ⋮ Continuous shift commuting maps between ultragraph shift spaces ⋮ Tree-shifts of finite type ⋮ Reducibility of covers of AFT shifts ⋮ Integrality for TQFTs ⋮ Subshifts of quasi-finite type ⋮ Order isomorphism under higher power shift and generic form of renormalization group equations in multimodal maps ⋮ Symbolic discrepancy and self-similar dynamics. ⋮ Procedures for calculating reversible one-dimensional cellular automata ⋮ Lifting factor maps to resolving maps ⋮ Learning to imitate stochastic time series in a compositional way by chaos ⋮ Open maps: small and large holes with unusual properties ⋮ A gauge invariant uniqueness theorem for corners of higher rank graph algebras ⋮ \(AH\)-substitution and Markov partition of a group automorphism on \(T^d\) ⋮ Homoclinic bifurcations for the Hénon map ⋮ On structural properties of eta-expansions of identity ⋮ Statistical mechanics of complex systems for pattern identification ⋮ Unique expansions of real numbers ⋮ Statistical estimation of multiple parameters via symbolic dynamic filtering ⋮ On the topological orbit equivalence in a class of substitution minimal systems ⋮ An Ihara formula for partially directed graphs ⋮ Stabilizing stationary linear discrete systems: Minimal and balanced expansions in any real base ⋮ A conjugacy invariant for reducible sofic shifts and its semigroup characterizations ⋮ Geometry of the common dynamics of flipped Pisot substitutions ⋮ About frequencies of letters in generalized automatic sequences ⋮ Augmented group systems and shifts of finite type ⋮ On recognizable sets of integers ⋮ Language complexity of rotations and Sturmian sequences ⋮ On the bound of the synchronization delay of a local automaton ⋮ Cyclic renewal systems ⋮ Realtime subshifts ⋮ On the directional dynamics of additive cellular automata ⋮ On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts ⋮ Applications of automata and graphs: Labeling-operators in Hilbert space. I ⋮ On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems ⋮ Conjugacy of \(Z^2\)-subshifts and textile systems ⋮ Spanning tree invariants, loop systems and doubly stochastic matrices ⋮ de Bruijn sequences and de Bruijn graphs for a general language ⋮ Endomorphisms of the shift dynamical system, discrete derivatives, and applications ⋮ Topological chaos: A spectral property for the shift on a sequence space ⋮ Forbidden words in symbolic dynamics ⋮ Determinization of transducers over finite and infinite words. ⋮ Small polynomial matrix presentations of nonnegative matrices ⋮ Factor maps, entropy and fiber cardinality for Markov shifts ⋮ On a lemma of Gromov and the entropy of a graph ⋮ A weak equivalence between shifts of finite type ⋮ Prefix-suffix automaton associated with a primitive substitution ⋮ Randomness on full shift spaces ⋮ Generalized Fermat, double Fermat and Newton sequences. ⋮ Data compression and learning in time sequences analysis ⋮ Iterated function systems and the code space

This page was built for publication: An Introduction to Symbolic Dynamics and Coding