Tootfinder

Cellular Automata as Generators of Interleaving Sequences
Sara D. Cardell
https://arxiv.org/abs/2506.18848 https://arxiv.org/pdf/2506…

Cellular Automata as Generators of Interleaving Sequences
An interleaving sequence is obtained by combining or intertwining elements from two or more sequences. On the other hand, cellular automata are known to be generators for keystream sequences. In this paper we present two families of one-dimensional cellular automata as generators of interleaving sequences. This study aims to close a notable gap within the current body of literature by exploring the capacity of cellular automata to generate interleaving sequences. While previous works have separ…

Neural Cellular Automata for ARC-AGI
Kevin Xu, Risto Miikkulainen
https://arxiv.org/abs/2506.15746 https://arxiv.org/pdf/2506.15746…

Neural Cellular Automata for ARC-AGI
Cellular automata and their differentiable counterparts, Neural Cellular Automata (NCA), are highly expressive and capable of surprisingly complex behaviors. This paper explores how NCAs perform when applied to tasks requiring precise transformations and few-shot generalization, using the Abstraction and Reasoning Corpus for Artificial General Intelligence (ARC-AGI) as a domain that challenges their capabilities in ways not previously explored. Specifically, this paper uses gradient-based train…

Temporal Neural Cellular Automata: Application to modeling of contrast enhancement in breast MRI
Daniel M. Lang, Richard Osuala, Veronika Spieker, Karim Lekadir, Rickmer Braren, Julia A. Schnabel
https://arxiv.org/abs/2506.18720

Temporal Neural Cellular Automata: Application to modeling of contrast enhancement in breast MRI
Synthetic contrast enhancement offers fast image acquisition and eliminates the need for intravenous injection of contrast agent. This is particularly beneficial for breast imaging, where long acquisition times and high cost are significantly limiting the applicability of magnetic resonance imaging (MRI) as a widespread screening modality. Recent studies have demonstrated the feasibility of synthetic contrast generation. However, current state-of-the-art (SOTA) methods lack sufficient measures …

Characterizing and Testing Configuration Stability in Two-Dimensional Threshold Cellular Automata
Yonatan Nakar, Dana Ron
https://arxiv.org/abs/2507.14569 …

Characterizing and Testing Configuration Stability in Two-Dimensional Threshold Cellular Automata
We consider the problems of characterizing and testing the stability of cellular automata configurations that evolve on a two-dimensional torus according to threshold rules with respect to the von-Neumann neighborhood. While stable configurations for Threshold-1 (OR) and Threshold-5 (AND) are trivial (and hence easily testable), the other threshold rules exhibit much more diverse behaviors. We first characterize the structure of stable configurations with respect to the Threshold-2 (similarly, …

Programmable Anyon Mobility through Higher Order Cellular Automata
Jie-Yu Zhang, Peng Ye
https://arxiv.org/abs/2508.13961 https://arxiv.org/pdf/2508.13961

Programmable Anyon Mobility through Higher Order Cellular Automata
Controlling anyon mobility is critical for robust quantum memory and understanding symmetry-enriched topological (SET) phases with subsystem symmetries (e.g., line-like, fractal, chaotic, or mixed supports). However, a unified framework for anyon mobility in SET phases with such diverse geometric patterns of symmetry supports has remained a major challenge. In this Letter, by introducing higher-order cellular automata (HOCA) -- a powerful computer science tool -- to SET physics, we establish a …

Exploring the Landscape of Non-Equilibrium Memories with Neural Cellular Automata
Ethan Lake, Ehsan Pajouheshgar
https://arxiv.org/abs/2508.15726 https://a…

Exploring the Landscape of Non-Equilibrium Memories with Neural Cellular Automata
We investigate the landscape of many-body memories: families of local non-equilibrium dynamics that retain information about their initial conditions for thermodynamically long time scales, even in the presence of arbitrary perturbations. In two dimensions, the only well-studied memory is Toom's rule. Using a combination of rigorous proofs and machine learning methods, we show that the landscape of 2D memories is in fact quite vast. We discover memories that correct errors in ways qualitatively…

Replaced article(s) found for cs.CC. https://arxiv.org/list/cs.CC/new
[1/1]:
- Fast Simulation of Cellular Automata by Self-Composition
Joseph Natal, Oleksiy Al-saadi

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- The maximum distinctness of physical systems
Norman Margolus
https://

Crosslisted article(s) found for cs.CV. https://arxiv.org/list/cs.CV/new
[2/2]:
- Exploring the Landscape of Non-Equilibrium Memories with Neural Cellular Automata
Ethan Lake, Ehsan Pajouheshgar

Bayesian Inversion via Probabilistic Cellular Automata: an application to image denoising
Danilo Costarelli, Michele Piconi, Alessio Troiani
https://arxiv.org/abs/2507.14869 htt…

Bayesian Inversion via Probabilistic Cellular Automata: an application to image denoising
We propose using Probabilistic Cellular Automata (PCA) to address inverse problems with the Bayesian approach. In particular, we use PCA to sample from an approximation of the posterior distribution. The peculiar feature of PCA is their intrinsic parallel nature, which allows for a straightforward parallel implementation that allows the exploitation of parallel computing architecture in a natural and efficient manner. We compare the performance of the PCA method with the standard Gibbs sampler …

#DebugArt #STRATA #GenerativeArt #AlgorthmicArt

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Programmable Anyon Mobility through Higher Order Cellular Automata
Jie-Yu Zhang, Peng Ye

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Generating 3D Terrain with 2D Cellular Automata
Nuno Fachada, Ant\'onio R. Rodrigues, Diogo de Andrade, Phil Lopes

A critical phase transition in bee movement dynamics can be modeled using a 2D cellular automata
Ivan Shpurov, Tom Froese
https://arxiv.org/abs/2507.11592 …

A critical phase transition in bee movement dynamics can be modeled using a 2D cellular automata
The collective behavior of numerous animal species, including insects, exhibits scale-free behavior indicative of the critical (second-order) phase transition. Previous research uncovered such phenomena in the behavior of honeybees, most notably the long-range correlations in space and time. Furthermore, it was demonstrated that the bee activity in the hive manifests the hallmarks of the jamming process. We follow up by presenting a discrete model of the system that faithfully replicates some o…

Reversibility, balance and expansivity of non-uniform cellular automata
Katariina Paturi
https://arxiv.org/abs/2507.06896 https://arx…

Reversibility, balance and expansivity of non-uniform cellular automata
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 examine what properties of uniform CA can be recovered by restricting the rule distribution to be (uniformly) recurrent, focusing on only 1D NUCA. We show that a bijective NUCA with a uniformly recurrent rule distribution is reversible. We also show that if a …

A Cellular Automata Approach to Donation Game
Marcin Kowalik, Przemys{\l}aw Stok{\l}osa, Mateusz Grabowski, Janusz Starzyk, Pawe{\l} Raif
https://arxiv.org/abs/2507.11744

A Cellular Automata Approach to Donation Game
The donation game is a well-established framework for studying the emergence and evolution of cooperation in multi-agent systems. The cooperative behavior can be influenced by the environmental noise in partially observable settings and by the decision-making strategies of agents, which may incorporate not only reputation but also traits such as generosity and forgiveness. Traditional simulations often assume fully random interactions, where cooperation is tested between randomly selected agent…

Crosslisted article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Exploring the Landscape of Non-Equilibrium Memories with Neural Cellular Automata
Ethan Lake, Ehsan Pajouheshgar

More #STRATA...
#GenerativeArt #AlgorthmicArt #Barricelli

Gaussian concentration bounds for probabilistic cellular automata
Jean-Ren\'e Chazottes, Frank Redig, Edgardo Ugalde
https://arxiv.org/abs/2507.05431 h…

Gaussian concentration bounds for probabilistic cellular automata
We study lattice spin systems and analyze the evolution of Gaussian concentration bounds (GCB) under the action of probabilistic cellular automata (PCA), which serve as discrete-time analogues of Markovian spin-flip dynamics. We establish the conservation of GCB and, in the high-noise regime, demonstrate that GCB holds for the unique stationary measure. Additionally, we prove the equivalence of GCB for the space-time measure and its spatial marginals in the case of contractive probabilistic cel…

[2025-06-23 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Identification of Cellular Automata on Spaces of Bernoulli Probability Measures
Faizal Hafiz, Amelia Kunze, Enrico Formenti, Davide La Torre
https://arxiv.org/abs/2506.22867

Identification of Cellular Automata on Spaces of Bernoulli Probability Measures
Classical Cellular Automata (CCAs) are a powerful computational framework for modeling global spatio-temporal dynamics with local interactions. While CCAs have been applied across numerous scientific fields, identifying the local rule that governs observed dynamics remains a challenging task. Moreover, the underlying assumption of deterministic cell states often limits the applicability of CCAs to systems characterized by inherent uncertainty. This study, therefore, focuses on the identificatio…

[2025-06-24 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

On the surjunctivity and the Garden of Eden theorem for non-uniform cellular automata
Katariina Paturi, Jarkko Kari
https://arxiv.org/abs/2507.06987 https:…

On the surjunctivity and the Garden of Eden theorem for non-uniform cellular automata
Non-uniform cellular automata (NUCA) are an extension of cellular automata with multiple local rules in different cells. We show that if the distribution of local rules is uniformly recurrent, or recurrent in the one-dimensional case, the Garden of Eden theorem holds. We also show that for any non-recurrent distribution, there is a substitution of local rules that defines a NUCA which does not satisfy the Garden of Eden theorem. Finally, we show that a rule distribution asymptotic to recurrent …

Growing Reservoirs with Developmental Graph Cellular Automata
Matias Barandiaran, James Stovold
https://arxiv.org/abs/2508.08091 https://arxiv.org/pdf/2508…

Growing Reservoirs with Developmental Graph Cellular Automata
Developmental Graph Cellular Automata (DGCA) are a novel model for morphogenesis, capable of growing directed graphs from single-node seeds. In this paper, we show that DGCAs can be trained to grow reservoirs. Reservoirs are grown with two types of targets: task-driven (using the NARMA family of tasks) and task-independent (using reservoir metrics). Results show that DGCAs are able to grow into a variety of specialized, life-like structures capable of effectively solving benchmark tasks, stat…

A 10-bit S-box generated by Feistel construction from cellular automata
Thomas Pr\'evost (I3S), Bruno Martin (I3S)
https://arxiv.org/abs/2507.02489 htt…

A 10-bit S-box generated by Feistel construction from cellular automata
We propose a new 10-bit S-box generated from a Feistel construction. The subpermutations are generated by a 5-cell cellular automaton based on a unique well-chosen rule and bijective affine transformations. In particular, the cellular automaton rule is chosen based on empirical tests of its ability to generate good pseudorandom output on a ring cellular automaton. Similarly, Feistel's network layout is based on empirical data regarding the quality of the output S-box. We perform cryptanalysis o…

[2025-07-24 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Hydrodynamic fluctuations of stochastic charged cellular automata
Takato Yoshimura, \v{Z}iga Krajnik
https://arxiv.org/abs/2506.05247 https://

Hydrodynamic fluctuations of stochastic charged cellular automata
We study charge fluctuations of a family of stochastic charged cellular automata away from the deterministic single-file limit and obtain the exact typical charge probability distributions, known to be anomalous, using hydrodynamics. The cellular automata considered are examples of linearly degenerate systems where two distinct mechanisms of diffusion, namely normal and convective diffusion, coexist. Our formalism, based on macroscopic fluctuation theory, allows us to describe current fluctuati…

[2025-07-23 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Causal Decompositions of 1D Quantum Cellular Automata
Augustin Vanrietvelde, Octave Mestoudjian, Pablo Arrighi
https://arxiv.org/abs/2506.22219 https://

Causal Decompositions of 1D Quantum Cellular Automata
Understanding quantum theory's causal structure stands out as a major matter, since it radically departs from classical notions of causality. We present advances in the research program of causal decompositions, which investigates the existence of an equivalence between the causal and the compositional structures of unitary channels. Our results concern one-dimensional Quantum Cellular Automata (1D QCAs), i.e. unitary channels over a line of $N$ quantum systems (with or without periodic boundar…

This https://arxiv.org/abs/2503.05572 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Word problems and embedding-obstructions in cellular automata groups on groups
We study groups of reversible cellular automata, or CA groups, on groups. More generally, we consider automorphism groups of subshifts of finite type on groups. It is known that word problems of CA groups on virtually nilpotent groups are in co-NP, and can be co-NP-hard. We show that under the Gap Conjecture of Grigorchuk, their word problems are PSPACE-hard on all other groups. On free and surface groups, we show that they are indeed always in PSPACE. On a group with co-NEXPTIME word problem, …

Identity Increases Stability in Neural Cellular Automata
James Stovold
https://arxiv.org/abs/2508.06389 https://arxiv.org/pdf/2508.06389

Identity Increases Stability in Neural Cellular Automata
Neural Cellular Automata (NCAs) offer a way to study the growth of two-dimensional artificial organisms from a single seed cell. From the outset, NCA-grown organisms have had issues with stability, their natural boundary often breaking down and exhibiting tumour-like growth or failing to maintain the expected shape. In this paper, we present a method for improving the stability of NCA-grown organisms by introducing an 'identity' layer with simple constraints during training. Results show that…

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Universality Frontier for Asynchronous Cellular Automata
Ivan Baburin, Matthew Cook, Florian Gr\"otschla, Andreas Plesner, Roger Wattenhofer

[2025-07-22 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Reservoir Computing with Evolved Critical Neural Cellular Automata
Sidney Pontes-Filho, Stefano Nichele, Mikkel Lepper{\o}d
https://arxiv.org/abs/2508.02218 https://

Reservoir Computing with Evolved Critical Neural Cellular Automata
Criticality is a behavioral state in dynamical systems that is known to present the highest computation capabilities, i.e., information transmission, storage, and modification. Therefore, such systems are ideal candidates as a substrate for reservoir computing, a subfield in artificial intelligence. Our choice of a substrate is a cellular automaton (CA) governed by an artificial neural network, also known as neural cellular automaton (NCA). We apply evolution strategy to optimize the NCA to ach…

[2025-08-22 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Using Dynamical Systems Theory to Quantify Complexity in Asymptotic Lenia
Ivan Yevenko, Hiroki Kojima, Chrystopher L. Nehaniv
https://arxiv.org/abs/2508.02935 https://

Using Dynamical Systems Theory to Quantify Complexity in Asymptotic Lenia
Continuous cellular automata (CCAs) have evolved from discrete lookup tables to continuous partial differential equation (PDE) formulations in the search for novel forms of complexity. Despite innovations in qualitative behavior, analytical methods have lagged behind, reinforcing the notion that emergent complexity defies simple explanation. In this paper, we demonstrate that the PDE formulation of Asymptotic Lenia enables rigorous analysis using dynamical systems theory. We apply the concepts …

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Deterministic many-body dynamics with multifractal response
Yusuf Kasim, Toma\v{z} Prosen

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Fast offline decoding with local message-passing automata
Ethan Lake

Counting Short Trajectories in Elementary Cellular Automata using the Transfer Matrix Method
C\'edric Koller, Barbora Hudcov\'a
https://arxiv.org/abs/2508.09768 https://…

Counting Short Trajectories in Elementary Cellular Automata using the Transfer Matrix Method
Elementary Cellular Automata (ECAs) exhibit diverse behaviours often categorized by Wolfram's qualitative classification. To provide a quantitative basis for understanding these behaviours, we investigate the global dynamics of such automata and we describe a method that allows us to compute the number of all configurations leading to short attractors in a limited number of time steps. This computation yields exact results in the thermodynamic limit (as the CA grid size grows to infinity), and …

Complex wave functions, CPT and quantum field theory for classical generalized Ising models
Christof Wetterich
https://arxiv.org/abs/2505.24392 https://

Complex wave functions, CPT and quantum field theory for classical generalized Ising models
The quantum or quantum field theory concept of a complex wave function is useful for understanding the information transport in classical statistical generalized Ising models. We relate complex conjugation to the discrete transformations charge conjugation ($C$), parity ($P$) and time reversal ($T$). A subclass of generalized Ising models are probabilistic cellular automata (PCA) with deterministic updating and probabilistic initial conditions. Two-dimensional PCA correspond to discretize…

[2025-07-21 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-21 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-06-20 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-20 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Post-apocalyptic computing from cellular automata
Genaro J. Martinez, Andrew Adamatzky, Guanrong Chen
https://arxiv.org/abs/2508.06035 https://arxiv.org/pd…

Post-apocalyptic computing from cellular automata
Cellular automata are arrays of finite state machines that can exist in a finite number of states. These machines update their states simultaneously based on specific local rules that govern their interactions. This framework provides a simple yet powerful model for studying complex systems and emergent behaviors. We revisit and reconsider the traditional notion of an algorithm, proposing a novel perspective in which algorithms are represented through the dynamic state-space configurations of c…

Flow-Lenia: Emergent evolutionary dynamics in mass conservative continuous cellular automata
Erwan Plantec, Gautier Hamon, Mayalen Etcheverry, Bert Wang-Chak Chan, Pierre-Yves Oudeyer, Cl\'ement Moulin-Frier
https://arxiv.org/abs/2506.08569

Flow-Lenia: Emergent evolutionary dynamics in mass conservative continuous cellular automata
Central to the artificial life endeavour is the creation of artificial systems spontaneously generating properties found in the living world such as autopoiesis, self-replication, evolution and open-endedness. While numerous models and paradigms have been proposed, cellular automata (CA) have taken a very important place in the field notably as they enable the study of phenomenons like self-reproduction and autopoiesis. Continuous CA like Lenia have been showed to produce life-like patterns rem…

Adaptive Exploration in Lenia with Intrinsic Multi-Objective Ranking
Niko Lorantos, Lee Spector
https://arxiv.org/abs/2506.02990 https://

Adaptive Exploration in Lenia with Intrinsic Multi-Objective Ranking
Artificial life aims to understand the fundamental principles of biological life by creating computational models that exhibit life-like properties. Although artificial life systems show promise for simulating biological evolution, achieving open-endedness remains a central challenge. This work investigates mechanisms to promote exploration and unbounded innovation within evolving populations of Lenia continuous cellular automata by evaluating individuals against each other with respect to dist…

Elementary Cellular Automata as Non-Cryptographic Hash Functions
Daniel McKinley
https://arxiv.org/abs/2506.06551 https://arxiv.org/p…

Elementary Cellular Automata as Non-Cryptographic Hash Functions
A subset of 10 of the 256 elementary cellular automata (ECA) are implemented as a hash function using an error minimization lossy compression algorithm operating on wrapped 4x4 neighborhood cells. All 256 rules are processed and 10 rules in two subsets of 8 are found to have properties that include both error minimization and maximization, unique solutions, a lossy inverse, efficient retroactive hashing, and an application to edge detection. The algorithm parallels the nested powers-of-two stru…

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
Finding ground states of a square Newman-Moore lattice with sides equal to a Mersenne number usin...

[2025-06-19 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-19 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

A perturbed cellular automaton with two phase transitions for the ergodicity
Hugo Marsan, Mathieu Sablik, Ilkka T\"orm\"a
https://arxiv.org/abs/2507.03485 https://

[2025-06-18 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-18 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-18 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Rethinking Self-Replication: Detecting Distributed Selfhood in the Outlier Cellular Automaton
Arend Hintze, Clifford Bohm
https://arxiv.org/abs/2508.08047 https://

Rethinking Self-Replication: Detecting Distributed Selfhood in the Outlier Cellular Automaton
Spontaneous self-replication in cellular automata has long been considered rare, with most known examples requiring careful design or artificial initialization. In this paper, we present formal, causal evidence that such replication can emerge unassisted -- and that it can do so in a distributed, multi-component form. Building on prior work identifying complex dynamics in the Outlier rule, we introduce a data-driven framework that reconstructs the full causal ancestry of patterns in a determini…

[2025-06-17 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Crosslisted article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Random Permutation Circuits are Quantum Chaotic
Bruno Bertini, Katja Klobas, Pavel Kos, Daniel Malz

MaCE: General Mass Conserving Dynamics for Cellular Automata
Vassilis Papadopoulos, Etienne Guichard
https://arxiv.org/abs/2507.12306 https://arxiv.org/pdf…

Frequency-Histogram Coarse Graining in Elementary Cellular Automata and 2D CA
Sanyam Jain, Stefano Nichele
https://arxiv.org/abs/2507.18674 https://arxiv.o…

Frequency-Histogram Coarse Graining in Elementary Cellular Automata and 2D CA
Cellular automata and other discrete dynamical systems have long been studied as models of emergent complexity. Recently, neural cellular automata have been proposed as models to investigate the emerge of a more general artificial intelligence, thanks to their propensity to support properties such as self-organization, emergence, and open-endedness. However, understanding emergent complexity in large scale systems is an open challenge. How can the important computations leading to emergent comp…

[2025-07-17 Thu (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

This https://arxiv.org/abs/2308.00060 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_nli…

An Invitation to Number-Conserving Cellular Automata
Number-conserving cellular automata are discrete dynamical systems that simulate interacting particles like e.g. grains of sand. In an earlier paper, I had already derived a uniform construction for all transition rules of one-dimensional number-conserving automata. Here I describe in greater detail how one can simulate the automata on a computer and how to find interesting rules. I show several rules that I have found this way and also some theorems about the space of number-conserving automat…

[2025-06-16 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Loop Patterns Formed by Cellular Automata
Rolf Hoffmann, Mariusz Bia{\l}ecki
https://arxiv.org/abs/2505.22679 https://arxiv.org/pdf/2…

Loop Patterns Formed by Cellular Automata
A Cellular Automata (CA) rule is presented that can generate "loop patterns" in a 2D grid under fixed boundary conditions. A loop is a cyclically closed path represented by one-cells enclosed by zero-cells. A loop pattern can contain several loops that are not allowed to touch each other. The problem is solved by designing an appropriate set of tiles that can overlap and which are used in the CA rule. Templates are derived from the tiles which are used for local pattern matching. In order to dr…

Loop Patterns Formed by Cellular Automata
Rolf Hoffmann, Mariusz Bia{\l}ecki
https://arxiv.org/abs/2505.22679 https://arxiv.org/pdf/2…

Loop Patterns Formed by Cellular Automata
A Cellular Automata (CA) rule is presented that can generate "loop patterns" in a 2D grid under fixed boundary conditions. A loop is a cyclically closed path represented by one-cells enclosed by zero-cells. A loop pattern can contain several loops that are not allowed to touch each other. The problem is solved by designing an appropriate set of tiles that can overlap and which are used in the CA rule. Templates are derived from the tiles which are used for local pattern matching. In order to dr…

[2025-07-16 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-15 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-14 Thu (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-14 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-06-13 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Essential metrics for Life on graphs
Michiel Rollier, Lucas Caldeira de Oliveira, Odemir M. Bruno, Jan M. Baetens

[2025-08-13 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-06-12 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-12 Tue (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-06-11 Wed (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-11 Mon (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-11 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-06-10 Tue (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- A More Convex Ising Formulation of Max-3-Cut Using Higher-Order Spin Interactions
Robbe De Prins, Guy Van der Sande, Peter Bienstman, Thomas Van Vaerenbergh

[2025-07-10 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-06-09 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
#toXiv_bot_toot #toXiv_bot_new_article_summary_toot

[2025-07-09 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-08 Tue (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-08 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-07 Thu (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-07 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-06-06 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
#toXiv_bot_toot

[2025-06-05 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
#toXiv_bot_toot

[2025-08-06 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-06-04 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
#toXiv_bot_toot

[2025-08-05 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-06-03 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
#toXiv_bot_toot

[2025-07-04 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-04 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Essential metrics for Life on graphs
Michiel Rollier, Lucas Caldeira de Oliveira, Odemir M. Bruno, Jan M. Baetens
https://arxiv.org/abs/2506.21226 https://…

Essential metrics for Life on graphs
We present a strong theoretical foundation that frames a well-defined family of outer-totalistic network automaton models as a topological generalisation of binary outer-totalistic cellular automata, of which the Game of Life is one notable particular case. These "Life-like network automata" are quantitatively described by expressing their genotype (the mean field curve and Derrida curve) and phenotype (the evolution of the state and defect averages). After demonstrating that the genotype and p…

[2025-06-02 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
#toXiv_bot_toot

[2025-07-03 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-01 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-01 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-05-30 Fri (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
#toXiv_bot_toot