Snakes and cellular automata: reductions and inseparability results

Authors:
Jarkko Kari
Affiliations:
Department of Mathematics, University of Turku, Turku, Finland
Venue:
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Year:
2011

Citing 9
Cited 0

Reversibility of 2D cellular automata is undecidable

Physica D
On the solvability of domino snake problems

Theoretical Computer Science
Reversibility and surjectivity problems of cellular automata

Journal of Computer and System Sciences
Regular Article: The surjectivity problem for 2D cellular automata

Proceedings of the 30th IEEE symposium on Foundations of computer science
On the Decidability of Self-Assembly of Infinite Ribbons

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Algorithmic self-assembly of dna

Algorithmic self-assembly of dna
Theory of cellular automata: a survey

Theoretical Computer Science
The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly

SIAM Journal on Computing
Infinite snake tiling problems

DLT'02 Proceedings of the 6th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A careful analysis of an old undecidability proof reveals that periodicity and non-surjectivity of two-dimensional cellular automata are recursively inseparable properties. Analogously, Wang tile sets that admit tilings of arbitrarily long loops (and hence also infinite snakes) are recursively inseparable from the tile sets that admit no loops and no infinite snakes. The latter inseparability result actually implies the first one in a trivial way.