%0 Conference Proceedings
%T Classification of Elementary Cellular Automata Up to Topological Conjugacy
%+ Technische Universität Dresden = Dresden University of Technology (TU Dresden)
%A Epperlein, Jeremias
%Z Part 2: Regular Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Turku, Finland
%Y Jarkko Kari
%I Springer
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-9099
%P 99-112
%8 2015-06-08
%D 2015
%R 10.1007/978-3-662-47221-7_8
%Z Computer Science [cs]Conference papers
%X Topological conjugacy is the natural notion of isomorphism in topological dynamics. It can be used as a very fine grained classification scheme for cellular automata. In this article, we investigate different invariants for topological conjugacy in order to distinguish between non-conjugate systems. In particular we show how to compute the cardinality of the set of points with minimal period <strong><i>n</i></strong>for one-dimensional CA. Applying these methods to the 256 elementary one-dimensional CA, we show that up to topological conjugacy there are exactly 83 of them.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-01442485/document
%2 https://inria.hal.science/hal-01442485/file/338243_1_En_8_Chapter.pdf
%L hal-01442485
%U https://inria.hal.science/hal-01442485
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-LNCS-9099
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA