Surjunctivity for cellular automata in Besicovitch spaces
S Capobianco - arxiv preprint arxiv:0705.0670, 2007 - arxiv.org
The Besicovitch pseudodistance measures the relative size of the set of points where two
functions take different values; the quotient space modulo the induced equivalence relation …
functions take different values; the quotient space modulo the induced equivalence relation …
Propriétés structurelles, combinatoires et logiques des pavages
A Ballier - 2009 - hal.science
Les pavages du plan discret expriment les conséquences de contraintes géométriques
simples. Ils sont définis par les agencements de couleurs qu'il est possible de former …
simples. Ils sont définis par les agencements de couleurs qu'il est possible de former …
Specific ergodicity: an informative indicator for invertible computational media
Specific ergodicity asks, for an invertible cellular automaton, lattice gas, or similar indefinitely-
extended computational medium, what fraction of the information needed to specify an …
extended computational medium, what fraction of the information needed to specify an …
On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems
S Capobianco - Information and Computation, 2009 - Elsevier
Consider the space of configurations from a finitely generated group to a finite alphabet. We
look at the translation-invariant closed subsets of this space, and at their continuous …
look at the translation-invariant closed subsets of this space, and at their continuous …
Induced subshifts and cellular automata
S Capobianco - Language and Automata Theory and Applications …, 2008 - Springer
Given a shift subspace over a finitely generated group, we define the subshift induced by it
on a larger group. Then we do the same with cellular automata and, while observing that the …
on a larger group. Then we do the same with cellular automata and, while observing that the …
[PDF][PDF] Conjugacy Results for Cellular Automata
S Capobianco - Citeseer
A cellular automaton is basically a “short” encoding of a transformation between colorings of
the nodes of a regular graph. Transformations having such encodings, in turn, define …
the nodes of a regular graph. Transformations having such encodings, in turn, define …
Cellular automata over semi-direct product groups: reduction and invertibility results
S Capobianco - International Journal of Algebra and Computation, 2006 - World Scientific
Cellular automata are transformations of configuration spaces over finitely generated
groups, such that the next state in a point only depends on the current state of a finite …
groups, such that the next state in a point only depends on the current state of a finite …