PuSH - Publication Server of Helmholtz Zentrum München: Graphical limit sets for general cellular automata.

Navigation

Home

Deutsch

Research

Advanced Search

Browse by ...

... Journal

... Publication Type

... Research Data

... Publication Year

Publication overview

Support & Contact

Contact persons

Help

Data protection

Müller, J. ; Jiang, H.*

Graphical limit sets for general cellular automata.

Theor. Comput. Sci. 580, 14-27 (2015)

DOI

Open Access Green as soon as Postprint is submitted to ZB.

Abstract
Metrics
Extra information

The existing theory of graphical limit sets for cellular automata relies on algebraic structures and applies only to certain classes of cellular automata that possess this structure. We extend this theory to general cellular automata using topological methods. The starting point is the observation that the rescaled space-time diagrams, intersected with an appropriately chosen compact set, form sequences in a compact, metric space. They necessarily possess converging subsequences. In the present paper we define graphical limit sets as the collection of the accumulation points. The main result is that for a large class of cellular automata the graphical limit set defined in this way carries a group structure, which is either the trivial group consisting of one element only, or is homeomorphic to S¹S1. The well known self-similar, graphical limit sets are representatives of the second class.

Altmetric

Additional Metrics?

[➜Log in]