scientific article

From MaRDI portal
Revision as of 01:01, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3545300

zbMath1158.37007MaRDI QIDQ3545300

Mike Boyle

Publication date: 10 December 2008


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (32)

Generating infinite monoids of cellular automataStrong Conley index over a phase spaceGlider automata on all transitive sofic shiftsBi-resolving graph homomorphisms and extensions of bi-closing codesMixing shifts of finite type with non-elementary surjective dimension representationsSimulation of effective subshifts by two-dimensional subshifts of finite typePath methods for strong shift equivalence of positive matricesProper -colorings of are BernoulliGate lattices and the stabilized automorphism groupFlip signaturesIntrinsic ergodicity beyond specification: \({\beta}\)-shifts, \(S\)-gap shifts, and their factorsUndecidability of the topological entropy of reversible cellular automata and related problemsGlider automorphisms and a finitary Ryan's theorem for transitive subshifts of finite typeOn intrinsic ergodicity of factors of subshiftsTransitive action on finite points of a full shift and a finitary Ryan’s theoremFinite group extensions of shifts of finite type: -theory, Parry and LivšicAutomaticity and Invariant Measures of Linear Cellular AutomataStrong shift equivalence and positive doubly stochastic matricesCategory theory of symbolic dynamicsHardness of conjugacy, embedding and factorization of multidimensional subshiftsGroup actions on Smale space -algebrasSpecification and towers in shift spacesExpansive automata networksIntrinsic ergodicity for factors of $(-\beta)$ -shiftsNilpotency and periodic points in non-uniform cellular automataOptimal state amalgamation is NP-hardPre-expansivity in cellular automataMass problems associated with effectively closed setsComplexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2Beyond Bowen’s Specification PropertyNonexpansive $\mathbb {Z}^2$-subdynamics and Nivat’s ConjectureSymbolic dynamics: entropy = dimension = complexity







This page was built for publication: