An Introduction to Symbolic Dynamics and Coding
From MaRDI portal
Publication:4856597
DOI10.1017/CBO9780511626302zbMath1106.37301OpenAlexW4206252072MaRDI QIDQ4856597
Publication date: 30 November 1995
Full work available at URL: https://doi.org/10.1017/cbo9780511626302
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
Positive matrices and their generalizations; cones of matrices (15B48) Other types of codes (94B60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to dynamical systems and ergodic theory (37-01) Topological entropy (37B40) Symbolic dynamics (37B10) Coding theorems (Shannon theory) (94A24)
Related Items (only showing first 100 items - show all)
Estimates on the number of orbits of the Dyck shift ⋮ Limit behaviour of \(\mu\)-equicontinuous cellular automata ⋮ Strong shift equivalence and the generalized spectral conjecture for nonnegative matrices ⋮ Asymptotic properties of free monoid morphisms ⋮ Markov process models of the dynamics of HIV reservoirs ⋮ On the entropy of a two step random Fibonacci substitution ⋮ Finitely balanced sequences and plasticity of 1-dimensional tilings ⋮ The multiplicative inequality for class degrees via relative transition classes ⋮ On one-sided, D-chaotic CA without fixed points, having continuum of periodic points with period 2 topological entropy \(\log(p)\) for any prime \(p\) ⋮ Classification of eventually periodic subshifts ⋮ Entropy for symbolic dynamics with overlapping alphabets ⋮ Strong Conley index over a phase space ⋮ Some remarks on real numbers induced by first-order spectra ⋮ On entropy of dynamical systems with almost specification ⋮ Stochastic dynamics: Markov chains and random transformations ⋮ Random \(\mathbb{Z}^d\)-shifts of finite type ⋮ A class of tridiagonal operators associated to some subshifts ⋮ A garden of Eden theorem for Anosov diffeomorphisms on tori ⋮ Étale groupoids arising from products of shifts of finite type ⋮ Observability of lattice graphs ⋮ Limit averages of continuous functions under the action of cellular automata ⋮ Solvable and algebraic systems on infinite ladder ⋮ Epistemic entanglement due to non-generating partitions of classical dynamical systems ⋮ Permutation cellular automata ⋮ The work of Kim and Roush in symbolic dynamics ⋮ Isomorphism and embedding of Borel systems on full sets ⋮ Bi-resolving graph homomorphisms and extensions of bi-closing codes ⋮ Mixing shifts of finite type with non-elementary surjective dimension representations ⋮ Independence entropy of \(\mathbb{Z}^{d}\)-shift spaces ⋮ Resolving extensions of finitely presented systems ⋮ A notion of synchronization of symbolic dynamics and a class of \(C ^{\ast }\)-algebras ⋮ Simulation of effective subshifts by two-dimensional subshifts of finite type ⋮ Path methods for strong shift equivalence of positive matrices ⋮ Cryptography based on chaotic random maps with position dependent weighting probabilities ⋮ Interval maps associated to the cellular automaton rule 184 ⋮ Presentations of Schützenberger groups of minimal subshifts. ⋮ A certain synchronizing property of subshifts and flow equivalence ⋮ Non-normal numbers with respect to Markov partitions ⋮ Computations on sofic \(S\)-gap shifts ⋮ Subshifts as models for MSO logic ⋮ Sofic tree-shifts ⋮ Special homeomorphisms and approximation for Cantor systems ⋮ Cellular automata between sofic tree shifts ⋮ Turing degrees of multidimensional SFTs ⋮ Local rule distributions, language complexity and non-uniform cellular automata ⋮ Path sets in one-sided symbolic dynamics ⋮ 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 ⋮ Random subshifts of finite type ⋮ An inner product space on irreducible and synchronizable probabilistic finite state automata ⋮ Dynamics and topology of \(S\)-gap shifts ⋮ Symbolic dynamics and synchronization of coupled map networks with multiple delays ⋮ Division point measures resulting from triangle subdivisions ⋮ Category equivalences involving graded modules over path algebras of quivers. ⋮ Vector space formulation of probabilistic finite state automata ⋮ Topological conjugacy on the complement of the periodic points ⋮ Extremal minimality conditions on automata ⋮ The learning problem of multi-layer neural networks ⋮ 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 Boolean control networks with maximal topological entropy ⋮ Three research directions in non-uniform cellular automata ⋮ Realization problems for nonuniform cellular automata ⋮ On the Fibonacci-Mandelbrot set ⋮ Topological and ergodic properties of symmetric sub-shifts ⋮ The structure of limit sets for \(\mathbb{Z}^d\) actions ⋮ Strong shift equivalence and positive doubly stochastic matrices ⋮ Variable time step dynamics with choice ⋮ Continuous orbit equivalence of topological Markov shifts and Cuntz-Krieger algebras ⋮ The waiting spectra of the sets described by the quantitative waiting time indicators ⋮ Category theory of symbolic dynamics ⋮ Uniform and Bernoulli measures on the boundary of trace monoids ⋮ \(\mu\)-limit sets of cellular automata from a computational complexity perspective ⋮ Hardness of conjugacy, embedding and factorization of multidimensional subshifts ⋮ A notion of effectiveness for subshifts on finitely generated groups ⋮ Realizing full \(n\)-shifts in simple Smale flows ⋮ Analogues of the prime number theorem and Mertens' theorem for closed orbits of the Motzkin shift ⋮ Nondeterministic cellular automata ⋮ Continuous orbit equivalence, flow equivalence of Markov shifts and circle actions on Cuntz-Krieger algebras ⋮ Quantum cognition and bounded rationality ⋮ A geometric interpretation of the Schützenberger group of a minimal subshift ⋮ Strongly connected multivariate digraphs ⋮ A more general method to classify up to equivariant \(KK\)-equivalence ⋮ Syndetically proximal pairs ⋮ Where to place a hole to achieve a maximal escape rate ⋮ Observable graphs ⋮ Directional dynamics along arbitrary curves in cellular automata ⋮ Generalized Besicovitch and Weyl spaces: topology, patterns, and sliding block codes ⋮ Bulking I: An abstract theory of bulking ⋮ Bulking II: Classifications of cellular automata ⋮ The complexity of Fibonacci-like kneading sequences ⋮ \(C^\ast\)-algebras associated with Hilbert \(C^\ast\)-quad modules of \(C^\ast\)-textile dynamical systems ⋮ Transitive sofic spacing shifts ⋮ Conserved quantities in discrete dynamics: what can be recovered from Noether's theorem, how, and why? ⋮ On entropy, entropy-like quantities, and applications ⋮ Solution structure of multi-layer neural networks with initial condition ⋮ Two results on entropy, chaos and independence in symbolic dynamics ⋮ On spatial entropy of multi-dimensional symbolic dynamical systems
This page was built for publication: An Introduction to Symbolic Dynamics and Coding
