相关论文: The Myhill property for cellular automata on amena…
We show that a large number of elementary cellular automata are computationally simple. This work is the first systematic classification of elementary cellular automata based on a formal notion of computational complexity. Thanks to the…
We show that conjugacy of reversible cellular automata is undecidable, whether the conjugacy is to be performed by another reversible cellular automaton or by a general homeomorphism. This gives rise to a new family of finitely-generated…
We prove that every linear-activity automaton group is amenable. The proof is based on showing that a sufficiently symmetric random walk on a specially constructed degree 1 automaton group -- the mother group -- has asymptotic entropy 0.…
We show that a finite group $G$ admitting an automorphism $\alpha$ such that the function $G\rightarrow G$, $g\mapsto g\alpha(g)$, is bijective is necessarily solvable.
We say that an action of a countable discrete inverse semigroup on a locally compact Hausdorff space is amenable if its groupoid of germs is amenable in the sense of Anantharaman-Delaroche and Renault. We then show that for a given inverse…
A two-state, three-dimensional, deterministic, reversible cellular automaton is shown to be capable of approximately circular orbits, wavelike undulations, and particle-like configurations that decay in accordance with a half-life law.
Bijections between sets may be seen as discrete (or crisp) unitary transformations used in quantum computations. So discrete quantum cellular automata are cellular automata with reversible transition functions. This note studies on 1d…
In this note, we prove that a semigroup $S$ is left amenable if and only if every two nonzero elements of $\ell^1_+(S)$ have a common nonzero right multiple, where $\ell^1_+(S)$ is the positive part of the Banach algebra $\ell^1(S)$, or…
Let $S$ be an inverse semigroup with the set of idempotents $E$. We prove that the semigroup algebra $\ell^{1}(S)$ is always $2n$-weakly module amenable as an $\ell^{1}(E)$-module, for any $n\in \mathbb{N}$, where $E$ acts on $S$ trivially…
In a recent paper [arXiv:1506.06649 [nlin.CG]], we presented an example of a 3-state cellular automaton which exhibits behaviour analogous to degenerate hyperbolicity often observed in finite-dimensional dynamical systems. We also…
In this article we consider semigroups of transformations of cellular automata which act on a fixed shift space. In particular, we are interested in two properties of these semigroups which relate to "largeness". The first property is ID…
In this article, we investigate some relations between dynamical and algebraic properties of semigroups of entire maps with applications to semigroups of formal series. We show that two entire maps fixing the origin share the set of…
Let A^Z be the Cantor space of bi-infinite sequences in a finite alphabet A, and let sigma be the shift map on A^Z. A `cellular automaton' is a continuous, sigma-commuting self-map Phi of A^Z, and a `Phi-invariant subshift' is a closed,…
We study some dynamical properties of a family of two-dimensional cellular automata: those that arise from an underlying one dimensional sand automaton whose local rule is obtained using a latin square. We identify a simple sand automaton G…
A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize such automata in terms of graphs…
Cellular automata are dynamical systems defined on lattices and commuting with the Bernoulli shift. In this work, we focus on the spectral properties of D-dimensional cellular automata. We give a characterization of their spectrum from both…
Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the r esult could actually make sense physically, as a valid quantum evolution; but…
We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such…
If M is a monoid (e.g. the lattice Z^D), and A is an abelian group, then A^M is a compact abelian group; a linear cellular automaton (LCA) is a continuous endomorphism F:A^M --> A^M that commutes with all shift maps. If F is diffusive, and…
Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global…