Pages that link to "Item:Q4016914"
From MaRDI portal
The following pages link to The Nilpotency Problem of One-Dimensional Cellular Automata (Q4016914):
Displayed 26 items.
- Cellular automata between sofic tree shifts (Q393113) (← links)
- Local rule distributions, language complexity and non-uniform cellular automata (Q393151) (← links)
- A uniquely ergodic cellular automaton (Q473194) (← links)
- Around probabilistic cellular automata (Q475395) (← links)
- Three research directions in non-uniform cellular automata (Q475396) (← links)
- Bulking II: Classifications of cellular automata (Q549701) (← links)
- Computation theoretic aspects of cellular automata (Q807035) (← links)
- Sand automata as cellular automata (Q837187) (← links)
- A search algorithm for subshift attractors of cellular automata (Q968269) (← links)
- The 4-way deterministic tiling problem is undecidable (Q1013128) (← links)
- Inducing an order on cellular automata by a grouping operation (Q1283794) (← links)
- Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results (Q1297435) (← links)
- Rice's theorem for the limit sets of cellular automata (Q1342233) (← links)
- On computing the entropy of cellular automata. (Q1401183) (← links)
- Theory of cellular automata: a survey (Q1779295) (← links)
- Cellular automata and communication complexity (Q1885923) (← links)
- Cellular automata in fuzzy backgrounds (Q1963284) (← links)
- On the undecidability of the limit behavior of cellular automata (Q2268864) (← links)
- Decidability and undecidability in cellular automata (Q2869780) (← links)
- A Characterization of Cellular Automata Generated by Idempotents on the Full Shift (Q2907509) (← links)
- TWO-DIMENSIONAL LANGUAGES AND CELLULAR AUTOMATA (Q2909191) (← links)
- (Un)Decidability of Injectivity and Surjectivity in One-Dimensional Sand Automata (Q3182963) (← links)
- Two-by-Two Substitution Systems and the Undecidability of the Domino Problem (Q3507464) (← links)
- Nilpotency and Limit Sets of Cellular Automata (Q3599142) (← links)
- Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling (Q5396587) (← links)
- THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE (Q5410736) (← links)