Snakes and Cellular Automata: Reductions and Inseparability Results (Q3007629): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the domino problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The surjectivity problem for 2D cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solvability of domino snake problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endomorphisms and automorphisms of the shift dynamical system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversibility of 2D cellular automata is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversibility and surjectivity problems of cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4412100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of cellular automata: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5796642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5333602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shorter Note: The Converse of Moore's Garden-of-Eden Theorem / rank
 
Normal rank

Latest revision as of 04:50, 4 July 2024

scientific article
Language Label Description Also known as
English
Snakes and Cellular Automata: Reductions and Inseparability Results
scientific article

    Statements