Results 11 to 20 of about 56 (51)
Conservation Laws and Invariant Measures in Surjective Cellular Automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We discuss a close link between two seemingly different topics studied in the cellular automata literature: additive conservation laws and invariant probability measures.
Jarkko Kari, Siamak Taati
doaj +1 more source
Asymptotic distribution of entry times in a cellular automaton with annihilating particles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 This work considers a cellular automaton (CA) with two particles: a stationary particle $1$ and left-going one $\overline{1}$. When a $\overline{1}$ encounters a $1$, both particles annihilate. We derive asymptotic distribution of appearence of particles
Petr Kůrka +2 more
doaj +1 more source
Cellular Lines: An Introduction [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 This paper provides a definition of a cellular line in a cellular array that is independent of the notion of a line in $\mathfrak{R}^2$.It also presents a way of determining whether or not a cell set is a cellular line.Brief statements about existence ...
Panama Geer +2 more
doaj +1 more source
Formalizing the transformations of a cognitive universe [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 In an effort to continue the pioneering work of Harary in USA and Flament in France, we have undertaken to develop, on an experimental basis, a formalized theory of systems of beliefs and their modifications.
N. Lafaye de Micheaux +3 more
doaj +1 more source
Dynamics of the Picking transformation on integer partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 This paper studies a conservative transformation defined on families of finite sets. It consists in removing one element from each set and adding a new set composed of the removed elements.
Thi Ha Duong Phan, Eric Thierry
doaj +1 more source
Experimental study of Elementary Cellular Automata dynamics using the density parameter [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Classifying cellular automata in order to capture the notion of chaos algorithmically is a challenging problem than can be tackled in many ways.We here give a classification based on the computation of a macroscopic parameter, the $d$-spectrum, and show ...
Nazim Fatès
doaj +1 more source
On undecidability of equicontinuity classification for cellular automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Equicontinuity classification is a popular classification of cellular automata based on their dynamical behavior. In this paper we prove that most of its classes are undecidable.
Bruno Durand +2 more
doaj +1 more source
On conservative and monotone one-dimensional cellular automata and their particle representation [PDF]
, 2000 Number-conserving (or conservative) cellular automata (CA) have been used in several contexts, in particular traffic models, where it is natural to think about them as systems of interacting particles.
Andrés Moreira +25 more
core +1 more source
Selfsimilarity, Simulation and Spacetime Symmetries [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We study intrinsic simulations between cellular automata and introduce a new necessary condition for a CA to simulate another one. Although expressed for general CA, this condition is targeted towards surjective CA and especially linear ones.
Vincent Nesme, Guillaume Theyssier
doaj +1 more source
A Reciprocity Theorem for Monomer-Dimer Coverings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 The problem of counting monomer-dimer coverings of a lattice is a longstanding problem in statistical mechanics.It has only been exactly solved for the special case of dimer coverings in two dimensions ([Ka61], [TF61]).
Nick Anzalone +3 more
doaj +1 more source