An Introduction to Symbolic Dynamics and Coding
From MaRDI portal
Publication:4856597
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)
Recommendations
Cited in
(only showing first 100 items - show all)- Dismantlability, Connectedness, and Mixing in Relational Structures
- Path sets in one-sided symbolic dynamics
- On finite generation of self-similar groups of finite type.
- Topological structure and entropy of mixing graph maps
- Strong synchronized system
- Strong shift equivalence and K2 of the dual numbers
- Splittings for \(C^*\)-correspondences and strong shift equivalence
- Eigenvalues of complex unit gain graphs and gain regularity
- Uniform generation in trace monoids
- Finitely generated subgroups of free groups as formal languages and their cogrowth
- Unbiased diffusion of Brownian particles on disordered correlated potentials
- Actions of symbolic dynamical systems on \(C^*\)-algebras. II: Simplicity of \(C^*\)-symbolic crossed products and some examples
- REVIEW OF CHAOS COMMUNICATION BY FEEDBACK CONTROL OF SYMBOLIC DYNAMICS
- Limit sets of stable cellular automata
- Decidability of flow equivalence and isomorphism problems for graph C*-algebras and quiver representations
- Asymptotic orbits of primitive substitutions
- The size of power automata.
- Trace asymptotics for \(C^{\ast}\)-algebras from Smale spaces
- Weak isomorphisms between Bernoulli shifts
- Presentations of Schützenberger groups of minimal subshifts.
- 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
- A Lebesgue-like measure for inverse limit spaces of piecewise strictly monotone maps of an interval
- The learning problem of multi-layer neural networks
- Algorithms for sliding block codes - An application of symbolic dynamics to information theory
- The zeta functions of renewal systems
- ON THE MONOTONICITY OF ENTROPY FOR MULTILAYER CELLULAR NEURAL NETWORKS
- Dynamical properties of \(S\)-gap shifts and other shift spaces
- Robust existence of nonhyperbolic ergodic measures with positive entropy and full support
- Codes and maximal monoids
- General framework
- \(\mu\)-limit sets of cellular automata from a computational complexity perspective
- A geometric interpretation of the Schützenberger group of a minimal subshift
- Two-sided shift spaces over infinite alphabets
- On the stability and shadowing of tree-shifts of finite type
- Generating infinite monoids of cellular automata
- A search algorithm for subshift attractors of cellular automata
- Totally dissipative measures for the shift and conformal \(\sigma \)-finite measures for the stable holonomies
- C*-algebras associated with presentations of subshifts ii. ideal structure and lambda-graph subsystems
- Approximating the hard square entropy constant with probabilistic methods
- Computing the topological entropy of shifts
- Algebraic properties of weak Perron numbers
- The symbolic dynamics of tiling the integers
- Asymptotic continuous orbit equivalence of Smale spaces and Ruelle algebras
- Periodicity ofβ-expansions for certain Pisot units
- Bounded delay timed channel coding
- Mixing properties of tree-shifts
- Smale space \(C^\ast\)-algebras have nonzero projections
- Regular language distance and entropy
- When are two multi-layer cellular neural networks the same?
- Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders
- On the trace subshifts of fractional multiplication automata
- Dismantlability, connectedness, and mixing in relational structures
- Existence of a measurable saturated compensation function between subshifts and its applications
- Synchronizing dynamical systems: their groupoids and \(C^*\)-algebras
- Étale difference algebraic groups
- Nonsingular dynamical systems, Bratteli diagrams and Markov odometers
- Strong shift equivalence and the generalized spectral conjecture for nonnegative matrices
- Generalized Bowen-Franks groups of integral matrices with the same zeta function
- On certain subshifts and their associated monoids
- Asymptotic properties of free monoid morphisms
- Lifting factor maps to resolving maps
- Markov process models of the dynamics of HIV reservoirs
- On the image set and reversibility of shift morphisms over discrete alphabets
- Bulking I: An abstract theory of bulking
- Bulking II: Classifications of cellular automata
- Embedding subshifts of finite type into the Fibonacci–Dyck shift
- On the computation of covert channel capacity
- Hereditary subshifts whose measure of maximal entropy does not have the Gibbs property
- \(C^*\)-subalgebras generated by partial isometries
- Group actions on labeled graphs and their \(C^{*}\)-algebras
- MINIMAL FORBIDDEN PATTERNS OF MULTI-DIMENSIONAL SHIFTS
- A class of simple \(C^{*}\)-algebras arising from certain non-sofic subshifts
- Endomorphisms of the shift dynamical system, discrete derivatives, and applications
- Beta-expansions, natural extensions and multiple tilings associated with Pisot units
- Parageometric outer automorphisms of free groups
- On entropy of dynamical systems with almost specification
- Box dimensions of (\timesm,\timesn)-invariant sets
- An approach to solving \(A^{k}=J-I\)
- K-THEORETIC INVARIANTS AND CONFORMAL MEASURES OF THE DYCK SHIFTS
- Randomness on full shift spaces
- Matrix characterization of multidimensional subshifts of finite type
- Factor theorems for locally compact Markov shifts
- Abelian closures of infinite binary words
- Chaotic social interaction via endogenous reactivity
- Linear Structures for Concurrency in Probabilistic Programming Languages
- KMS states on \(C^\ast\)-algebras associated to local homeomorphisms
- Multiplicities of covers for sofic shifts
- Path methods for strong shift equivalence of positive matrices
- Subsystem entropy for \(\mathbb {Z}^{d}\) sofic shifts
- Special homeomorphisms and approximation for Cantor systems
- Measures of maximal entropy for suspension flows over the full shift
- Computing degree and class degree
- Local rule distributions, language complexity and non-uniform cellular automata
- Learning to imitate stochastic time series in a compositional way by chaos
- Recent developments around partial actions
- On computing the Lyapunov exponents of reversible cellular automata
- An inner product space on irreducible and synchronizable probabilistic finite state automata
- Functions for relative maximization
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)
