Effective closed subshifts in 1D can be implemented in 2D

Authors:
Bruno Durand;Andrei Romashchenko;Alexander Shen
Affiliations:
LIF Marseille, CNRS and University Aix-Marseille;LIF Marseille, CNRS and University Aix-Marseille;LIF Marseille, CNRS and University Aix-Marseille
Venue:
Fields of logic and computation
Year:
2010

Citing 5
Cited 0

Reliable computation with cellular automata

Journal of Computer and System Sciences
Tilings and patterns

Tilings and patterns
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata
Fixed Point and Aperiodic Tilings

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Forbidden substrings, kolmogorov complexity and almost periodic sequences

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we use fixed point tilings to answer a question posed by Michael Hochman and show that every one-dimensional effectively closed subshift can be implemented by a local rule in two dimensions. The proof uses the fixed-point construction of an aperiodic tile set and its extensions.