scientific article; zbMATH DE number 5380239
From MaRDI portal
Publication:3545300
zbMATH Open1158.37007MaRDI QIDQ3545300FDOQ3545300
Publication date: 10 December 2008
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 2079138
- Algebraic aspects of symbolic dynamics
- Symbolic dynamics and nonlinear semiflows
- Some open problems in dynamical systems
- scientific article
- scientific article; zbMATH DE number 2109497
- Symbolic dynamics for nonhyperbolic systems
- scientific article
- scientific article; zbMATH DE number 2042127
- Solution of Two Conjectures in Symbolic Dynamics
Cited In (36)
- Title not available (Why is that?)
- Nilpotency and periodic points in non-uniform cellular automata
- Mass problems associated with effectively closed sets
- Specification and towers in shift spaces
- Generating infinite monoids of cellular automata
- Path sets in one-sided symbolic dynamics
- Path methods for strong shift equivalence of positive matrices
- Undecidability of the topological entropy of reversible cellular automata and related problems
- Glider automorphisms and a finitary Ryan's theorem for transitive subshifts of finite type
- Expansive automata networks
- Transitive action on finite points of a full shift and a finitary Ryan’s theorem
- Beyond Bowen’s Specification Property
- Pre-expansivity in cellular automata
- Flip signatures
- Gate lattices and the stabilized automorphism group
- Symbolic dynamics: entropy = dimension = complexity
- Title not available (Why is that?)
- Strong Conley index over a phase space
- Group actions on Smale space -algebras
- Finite group extensions of shifts of finite type: -theory, Parry and Livšic
- Intrinsic ergodicity beyond specification: \({\beta}\)-shifts, \(S\)-gap shifts, and their factors
- Automaticity and Invariant Measures of Linear Cellular Automata
- Optimal state amalgamation is NP-hard
- On intrinsic ergodicity of factors of subshifts
- Category theory of symbolic dynamics
- Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2
- Glider automata on all transitive sofic shifts
- Hardness of conjugacy, embedding and factorization of multidimensional subshifts
- Nonexpansive $\mathbb {Z}^2$-subdynamics and Nivat’s Conjecture
- Bi-resolving graph homomorphisms and extensions of bi-closing codes
- Mixing shifts of finite type with non-elementary surjective dimension representations
- Simulation of effective subshifts by two-dimensional subshifts of finite type
- Strong shift equivalence and positive doubly stochastic matrices
- Proper -colorings of are Bernoulli
- The shift equivalence problem.
- Intrinsic ergodicity for factors of $(-\beta)$ -shifts
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545300)
