The Nilpotency Problem of One-Dimensional Cellular Automata
From MaRDI portal
Publication:4016914
DOI10.1137/0221036zbMath0761.68067WikidataQ62045994 ScholiaQ62045994MaRDI QIDQ4016914
Publication date: 16 January 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5044b64aacc4b7a5626427fab48372a2d9f8a853
68Q80: Cellular automata (computational aspects)
Related Items
Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling, THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE, Cellular automata between sofic tree shifts, Local rule distributions, language complexity and non-uniform cellular automata, A uniquely ergodic cellular automaton, Around probabilistic cellular automata, Three research directions in non-uniform cellular automata, Bulking II: Classifications of cellular automata, Computation theoretic aspects of cellular automata, Sand automata as cellular automata, A search algorithm for subshift attractors of cellular automata, 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., Theory of cellular automata: a survey, Cellular automata and communication complexity, Cellular automata in fuzzy backgrounds, On the undecidability of the limit behavior of cellular automata, Decidability and undecidability in cellular automata, A Characterization of Cellular Automata Generated by Idempotents on the Full Shift, TWO-DIMENSIONAL LANGUAGES AND 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
