Related papers: L-Convex Polyominoes are Recognizable in Real Time…
We investigate how increasing the dimension of the array can help to draw signals on cellular automata.We show the existence of a gap of constructible signals in any dimension. We exhibit two cellular automata in dimension 2 to show that…
Column-convex polyominoes were introduced in 1950's by Temperley, a mathematical physicist working on "lattice gases". By now, column-convex polyominoes are a popular and well-understood model. There exist several generalizations of…
We examine emergent properties of 2D supramolecular networks, using enumeration of configurations formed by interacting dominoes on square lattices as a simple model system. Possible ground states are identified using a convex hull…
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…
Recently, we introduced a new class of shapes, called soft cells which fill space as soft tilings without gaps and overlaps while minimizing the number of sharp corners. We introduced the edge bending algorithm that deforms a polyhedral…
A feature of current membrane systems is the fact that objects and membranes are persistent. However, this is not true in the real world. In fact, cells and intracellular proteins have a well-defined lifetime. Inspired from these biological…
Cellular automata are investigated towards their ability to compute transductions, that is, to transform inputs into outputs. The families of transductions computed are classified with regard to the time allowed to process the input and to…
In this paper, under certain conditions we consider two-dimensional cellular automata with the Moore neighborhood. Namely, the characterization of 2D linear cellular automata defined by the Moore neighborhood with some mixed boundary…
Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints…
This paper provides a bridge between the classical tiling theory and the complex neighborhood self-assembling situations that exist in practice. The neighborhood of a position in the plane is the set of coordinates which are considered…
We prove the Voronoi conjecture for five-dimensional parallelohedra. Namely, we show that if a convex five-dimensional polytope $P$ tiles $\mathbb R^5$ with translations, then $P$ is an affine image of the Dirichlet-Voronoi polytope for a…
Convex polyominoes can be refined according to the number of direction changes in monotone paths connecting pairs of cells, leading to the notion of $k$-convexity. In particular, the cases $k=1$ and $k=2$ correspond to $L$-convex and…
Many biological phenomena are inherently multiscale, i.e. they are characterized by interactions involving different spatial and temporal scales simultaneously. Though several approaches have been proposed to provide "multilayer" models,…
In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information indefinitely is nontrivial, even in an infinite automaton. Still, there is a solution in 2…
A two-dimensional automaton operates on arrays of symbols. While a standard (four-way) two-dimensional automaton can move its input head in four directions, restricted two-dimensional automata are only permitted to move their input heads in…
Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…
This paper presents a novel approach to the description and understanding of two-dimensional binary cellular automata with the Moore neighborhood that preserve the number of active cells. Such dynamical systems are known to successfully…
Phylogenetic trees are used to model evolution: leaves are labelled to represent contemporary species ("taxa") and interior vertices represent extinct ancestors. Informally, convex characters are measurements on the contemporary species in…
In dynamical systems such as cellular automata and iterated maps, it is often useful to look at a language or set of symbol sequences produced by the system. There are well-established classification schemes, such as the Chomsky hierarchy,…
The first undecidability result on the tiling is the undecidability of translational tiling of the plane with Wang tiles, where there is an additional color matching requirement. Later, researchers obtained several undecidability results on…