Back to Search Start Over

Pre-expansivity in cellular automata

Authors :
Vincent Nesme
Guillaume Theyssier
Anahí Gajardo
Institut de Mathématiques de Marseille (I2M)
Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS)
CONICYT-FONDECYT#1140684CONICYT-Basal PFB03
Universidad de Concepción - University of Concepcion [Chile]
Universidad de Chile = University of Chile [Santiago] (UCHILE)
Lycée Georges Brassens
Source :
Theoretical Computer Science, Theoretical Computer Science, Elsevier, 2019, ⟨10.1016/j.tcs.2019.10.034⟩, Theoretical Computer Science, Elsevier, 2020, 816, pp.37-66. ⟨10.1016/j.tcs.2019.10.034⟩, Theoretical Computer Science, 2020, 816, pp.37-66. ⟨10.1016/j.tcs.2019.10.034⟩, Theoretical Computer Science, 2019, ⟨10.1016/j.tcs.2019.10.034⟩
Publication Year :
2020
Publisher :
Elsevier BV, 2020.

Abstract

International audience; We introduce the notion of pre-expansivity for cellular automata (CA): it is the property of being positively expansive on asymptotic pairs of configurations (i.e. configurations that differ in only finitely many positions). Pre-expansivity therefore lies between positive expansivity and pre-injectivity, two important notions of CA theory.We show that there exist one-dimensional pre-expansive CAs which are not positively expansive and they can be chosen reversible (while positive expansivity is impossible for reversible CAs). We provide both linear and non-linear examples. In the one-dimensional setting, we also show that pre-expansivity implies sensitivity to initial conditions in any direction. We show however that no two-dimensional Abelian CA can be pre-expansive. We also consider the finer notion of k-expansivity (positive expansivity over pairs of configurations with exactly k differences) and show examples of linear CA in dimension 2 and on the free group that are k-expansive depending on the value of k, whereas no (positively) expansive CA exists in this setting.

Details

ISSN :
03043975 and 18792294
Volume :
816
Database :
OpenAIRE
Journal :
Theoretical Computer Science
Accession number :
edsair.doi.dedup.....6492dd1f803f1554cab2cc9f513ab8ef
Full Text :
https://doi.org/10.1016/j.tcs.2019.10.034