English
Related papers

Related papers: Irrational eigenvalues of almost expansive cellula…

200 papers

We prove that the (language of the) asymptotic set (and the nonwandering set) of a one-dimensional cellular automaton can be $\SIGMA^1_1$-hard. We do not go into much detail, since the constructions are relatively standard.

Computational Complexity · Computer Science 2013-07-19 Ville Salo

In this paper, we prove that there is a strongly universal cellular automaton on the heptagrid with six states which is rotation invariant. This improves a previous paper of the author with 7 states. Here, the structures are modified and…

Formal Languages and Automata Theory · Computer Science 2023-05-05 Maurice Margenstern

We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic. This set turns out to be dense for…

Formal Languages and Automata Theory · Computer Science 2012-08-15 Alberto Dennunzio , Pietro Di Lena , Luciano Margara

In this paper, we prove that there is a strongly universal cellular automaton on the heptagrid with seven states which is rotation invariant. This improves a previous paper of the author where the automaton required ten states.

Discrete Mathematics · Computer Science 2021-02-09 Maurice Margenstern

Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A well know result, due to Kari, says that all nontrivial…

Dynamical Systems · Mathematics 2009-02-10 Pietro Di Lena , Luciano Margara

Non-uniform cellular automata (NUCA) are an extension of cellular automata (CA), which transform cells according to multiple different local rules. A NUCA is defined by a configuration of local rules called a local rule distribution. We…

Dynamical Systems · Mathematics 2025-07-10 Katariina Paturi

We show that a large number of elementary cellular automata are computationally simple. This work is the first systematic classification of elementary cellular automata based on a formal notion of computational complexity. Thanks to the…

Computational Complexity · Computer Science 2014-06-23 Pierre-Étienne Meunier

We establish several extensions of the well-known Garden of Eden theorem for non-uniform cellular automata over the full shifts and over amenable group universes. In particular, our results describe quantitatively the relations between the…

Dynamical Systems · Mathematics 2023-04-04 Xuan Kien Phung

We consider reversible and surjective cellular automata perturbed with noise. We show that, in the presence of positive additive noise, the cellular automaton forgets all the information regarding its initial configuration exponentially…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-21 Siamak Taati

Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…

Cellular Automata and Lattice Gases · Physics 2023-05-12 Luca Bertolani , Andrea Idini

In this paper we introduce the notion of quasi-expansivity for 2D CA and we show that it shares many properties with expansivity (that holds only for 1D CA). Similarly, we introduce the notions of quasi-sensitivity and prove that the…

Formal Languages and Automata Theory · Computer Science 2009-09-29 Enrico Formenti , Alberto Dennunzio , Michael Weiss

This study presents a unitary quantum cellular automaton (QCA) that, in the continuum limit, converges to the (1+1)-dimensional Generalized Dirac Equation (GDE). We outline the construction of the unitary, discrete-time evolution and derive…

Quantum Physics · Physics 2025-10-03 Xingyou Song

In this work, the one-dimensional Cellular Automaton is extended to one that involves two sets of symbols and two global rules. As a main result, the Extended Curtis-Hedlund-Lyndon Theorem is demonstrated. Such constructions can be useful…

Cellular Automata and Lattice Gases · Physics 2025-02-25 Pouya Mehdipour , Mostafa Salarinoghabi , Paula Gibrim

We investigate expressiveness, a parameter of one-dimensional cellular automata, in the context of simulated biological systems. The development of elementary cellular automata is interpreted in terms of biological systems, and biologically…

Cellular Automata and Lattice Gases · Physics 2013-04-09 Markus Redeker , Andrew Adamatzky , Genaro J. Martínez

This paper explores the algebraic conditions under which a cellular automaton with a non-linear local rule exhibits surjectivity and reversibility. We also analyze the role of permutivity as a key factor influencing these properties and…

Discrete Mathematics · Computer Science 2025-06-30 Firas Ben Ramdhane , Alberto Dennunzio , Luciano Margara , Giuliamaria Menara

The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this article, we introduce…

Discrete Mathematics · Computer Science 2010-09-17 Eric Goles Chacc , Pierre-Etienne Meunier , Ivan Rapaport , Guillaume Theyssier

We present a new spontaneously emergent glider-gun in a 2D Cellular Automaton and build the logical gates NOT, AND and OR required for logical universality. The Ameyalli-rule is not based on survival/birth logic but depends on 102 isotropic…

Cellular Automata and Lattice Gases · Physics 2021-07-14 José Manuel Gómez Soto , Andrew Wuensche

This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule…

Discrete Mathematics · Computer Science 2010-08-23 Martin Delacourt , Victor Poupet , Mathieu Sablik , Guillaume Theyssier

Gauge-invariance is a fundamental concept in Physics -- known to provide mathematical justification for the fundamental forces. In this paper, we provide discrete counterparts to the main gauge theoretical concepts directly in terms of…

Formal Languages and Automata Theory · Computer Science 2022-01-25 Pablo Arrighi , Giuseppe Di Molfetta , Nathanaël Eon

For analytic operator functions, we prove accumulation of branches of complex eigenvalues to the essential spectrum. Moreover, we show minimality and completeness of the corresponding system of eigenvectors and associated vectors. These…

Functional Analysis · Mathematics 2018-04-05 Christian Engström , Axel Torshage