The Nilpotency Problem of One-Dimensional Cellular Automata
From MaRDI portal
Recommendations
Cited in
(77)- The 4-way deterministic tiling problem is undecidable
- Inducing an order on cellular automata by a grouping operation
- Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results
- Rice's theorem for the limit sets of cellular automata
- On computing the entropy of cellular automata.
- On dynamical complexity of surjective ultimately right-expansive cellular automata
- An automaton group with undecidable order and Engel problems
- Strict asymptotic nilpotency in cellular automata
- Theory of cellular automata: a survey
- Cellular automata and communication complexity
- Cellular automata in fuzzy backgrounds
- Dynamical behavior of additive cellular automata over finite abelian groups
- Permutive one-way cellular automata and the finiteness problem for automaton groups
- Nilpotency and periodic points in non-uniform cellular automata
- On linear shifts of finite type and their endomorphisms
- On the impact of treewidth in the computational complexity of freezing dynamics
- Countable sofic shifts with a periodic direction
- On the conjugacy problem of cellular automata
- On the undecidability of the limit behavior of cellular automata
- Slopes of multidimensional subshifts
- Unraveling simplicity in elementary cellular automata
- Ergodicity of some classes of cellular automata subject to noise
- Arithmetical complexity of the language of generic limit sets of cellular automata
- On dynamical finiteness properties of algebraic group shifts
- Solving the parity problem in one-dimensional cellular automata
- Hierarchy and expansiveness in 2D subshifts of finite type
- Decidability and undecidability in cellular automata
- A characterization of cellular automata generated by idempotents on the full shift
- Two-dimensional languages and cellular automata
- Computational aspects of cellular automata on countable sofic shifts
- On the Limit Sets of Cellular Automata
- Revisiting the Rice theorem of cellular automata
- (Un)Decidability of Injectivity and Surjectivity in One-Dimensional Sand Automata
- Two-by-Two Substitution Systems and the Undecidability of the Domino Problem
- Nilpotency and Limit Sets of Cellular Automata
- Cellular automata between sofic tree shifts
- Local rule distributions, language complexity and non-uniform cellular automata
- scientific article; zbMATH DE number 522847 (Why is no real title available?)
- Automaton (semi)groups: Wang tilings and Schreier tries
- A uniquely ergodic cellular automaton
- Around probabilistic cellular automata
- Three research directions in non-uniform cellular automata
- \(\mu\)-limit sets of cellular automata from a computational complexity perspective
- On Nilpotency and Asymptotic Nilpotency of Cellular Automata
- scientific article; zbMATH DE number 7339755 (Why is no real title available?)
- Nilpotent endomorphisms of expansive group actions
- Self-stabilisation of Cellular Automata on Tilings
- Nondeterministic cellular automata
- Decidability in Group Shifts and Group Cellular Automata
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
- Decision problems for cellular automata and their semigroups
- Subshifts with sparse traces
- The undecidability of the domino problem
- An aperiodic set of 11 Wang tiles
- Characterizations of periods of multi-dimensional shifts
- Cellular automata, tilings and (un)computability
- Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling
- The finiteness problem for automaton semigroups is undecidable.
- Bulking II: Classifications of cellular automata
- Freezing, bounded-change and convergent cellular automata
- On computing the Lyapunov exponents of reversible cellular automata
- Cold dynamics in cellular automata: a tutorial
- Undecidable translational tilings with only two tiles, or one nonabelian tile
- Graph subshifts
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata
- On the parameterized complexity of freezing dynamics
- On countable SFT covers of sparse multidimensional shift spaces
- Strong stochastic stability of cellular automata
- Invariant sets and nilpotency of endomorphisms of algebraic sofic shifts
- Extinction dynamics in cellular automata: extensions of additive systems and nonlinear constructions
- Aperiodicity in quantum Wang tilings
- The word and order problems for self-similar and automata groups
- Computation theoretic aspects of cellular automata
- Sand automata as cellular automata
- Limit set problem of multi-agent systems with finite states: an eigenvalue-based approach
- A search algorithm for subshift attractors of cellular automata
This page was built for publication: The Nilpotency Problem of One-Dimensional Cellular Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016914)
