Pages that link to "Item:Q2869780"
From MaRDI portal
The following pages link to Decidability and undecidability in cellular automata (Q2869780):
Displaying 16 items.
- A Random NP-complete problem for inversion of 2D cellular automata (Q672376) (← links)
- Non-uniform cellular automata: classes, dynamics, and decidability (Q714501) (← links)
- Reversibility of 2D cellular automata is undecidable (Q807043) (← links)
- The immortality problem for Lag systems (Q918728) (← links)
- Reversibility and surjectivity problems of cellular automata (Q1318474) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- An automaton group with undecidable order and Engel problems (Q1693094) (← links)
- Decidability of sensitivity and equicontinuity for linear higher-order cellular automata (Q2278265) (← links)
- On the undecidability of attractor properties for cellular automata (Q2883185) (← links)
- Two-dimensional languages and cellular automata (Q2909191) (← links)
- (Q4219024) (← links)
- (Q5010161) (← links)
- A Decidability Result for the Halting of Cellular Automata on the Pentagrid (Q5126853) (← links)
- Subshifts with sparse traces (Q5139041) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311117) (← links)
- Cellular automata, tilings and (un)computability (Q5365564) (← links)