Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results
type: Item
instance of: scholarly article
title: Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results
zbMATH Open document ID: 0931.68073
DOI: 10.1016/S0012-365X(98)00203-9
author: V. Pereyra
published in: Discrete Mathematics
publication date: 1999-08-09T00:00:00Z
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 05B45
Mathematics Subject Classification ID: 37B15
zbMATH DE Number: 1321795
zbMATH Keywords: cellular automata
MaRDI profile type: Publication
cites work: The undecidability of the domino problem
cites work: On the Limit Sets of Cellular Automata
cites work: Remarks on Berger's paper on the domino problem
cites work: The Nilpotency Problem of One-Dimensional Cellular Automata
cites work: Undecidability and nonperiodicity for tilings of the plane
cites work: Classifying circular cellular automata
cites work: Q3675526
Recommended article: On pointwise periodicity in tilings, cellular automata, and subshifts
Recommended article: Nilpotency and periodic points in non-uniform cellular automata
Recommended article: On the undecidability of attractor properties for cellular automata
Recommended article: ON A CHARACTERIZATION OF CELLULAR AUTOMATA IN TILINGS OF THE HYPERBOLIC PLANE
Recommended article: Mathematical Foundations of Computer Science 2003
Recommended article: Periodic points for onto cellular automata
Recommended article: The Injectivity of the Global Function of a Cellular Automaton in the Hyperbolic Plane is Undecidable
Recommended article: Analytic proof of the attractors of a class of cellular automaton
Recommended article: Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines
Recommended article: Local non-periodic order and diam-mean equicontinuity on cellular automata
description: scientific article; zbMATH DE number 1321795