Results 1 to 10 of about 56 (51)
Number conserving cellular automata: new results on decidability and dynamics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 This paper is a survey on our recent results about number conserving cellular automata. First, we prove the linear time decidability of the property of number conservation. The sequel focuses on dynamical evolutions of number conserving cellular automata.
Bruno Durand +3 more
doaj +1 more source
NOCAS : A Nonlinear Cellular Automata Based Stream Cipher [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 LFSR and NFSR are the basic building blocks in almost all the state of the art stream ciphers like Trivium and Grain-128. However, a number of attacks are mounted on these type of ciphers.
Sandip Karmakar, Dipanwita Roy Chowdhury
doaj +1 more source
Tiling a Rectangle with Polyominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 A polycube in dimension $d$ is a finite union of unit $d$-cubes whose vertices are on knots of the lattice $\mathbb{Z}^d$. We show that, for each family of polycubes $E$, there exists a finite set $F$ of bricks (parallelepiped rectangles) such that the ...
Olivier Bodini
doaj +1 more source
Predecessor and Permutation Existence Problems for Sequential Dynamical Systems. [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 A class of finite discrete dynamical systems, called Sequential Dynamical Systems (SDSs), was introduced in [BR99] as a formal model for analyzing simulation systems.
Christopher L. Barrett +5 more
doaj +1 more source
A symbolic projection of Langton's Ant [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 The Langton's ant is studied from the point of view of topological dynamical systems. A new approach which associate a subshift to the system is proposed.The transition rule is generalized to the family of bi-regular graphs $\Gamma(k,d)$ and the ...
Anahi Gajardo
doaj +1 more source
Results and conjectures on the Sandpile Identity on a lattice [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 In this paper we study the identity of the Abelian Sandpile Model on a rectangular lattice.This configuration can be computed with the burning algorithm, which, starting from the empty lattice, computes a sequence of configurations, the last of which is ...
Arnaud Dartois, Clémence Magnien
doaj +1 more source
Orbits of the Bernoulli measure in single-transition asynchronous cellular automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We study iterations of the Bernoulli measure under nearest-neighbour asynchronous binary cellular automata (CA) with a single transition. For these CA, we show that a coarse-level description of the orbit of the Bernoulli measure can be obtained, that is,
Henryk Fukś, Andrew Skelton
doaj +1 more source
Product decomposition for surjective 2-block NCCA [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 In this paper we define products of one-dimensional Number Conserving Cellular Automata (NCCA) and show that surjective NCCA with 2 blocks (i.e radius 1/2) can always be represented as products of shifts and identites.
Felipe García-Ramos
doaj +1 more source
Cellular Automata for Simulating Molecular Self-Assembly [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 We present a lattice gas technique for simulating molecular self-assembly of amphiphilic polymers in aqueous environments. Water molecules, hydrocarbons tail-groups and amphiphilic head-groups are explicitly represented on a three dimensional discrete ...
Martin Nilsson, Steen Rasmussen
doaj +1 more source
The structure of communication problems in cellular automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Studying cellular automata with methods from communication complexity appears to be a promising approach. In the past, interesting connections between communication complexity and intrinsic universality in cellular automata were shown.
Raimundo Briceño +1 more
doaj +1 more source