相关论文: Invariant measures for bipermutative cellular auto…

Group cellular automata are continuous, shift-commuting endomorphisms of $G^\mathbb{Z}$, where $G$ is a finite group. We provide an easy-to-check characterization of expansivity for group cellular automata on abelian groups and we prove…

We consider an independent and identically distributed (i.i.d.) random dynamical system of simple linear transformations on the unit interval $T_{\beta}(x)=\beta x$ (mod $1$), $x\in[0,1]$, $\beta>0$, which are the so-called…

We consider a family S=S(a) of 2-valued transformations of special form on the segment [0,1] with measure $\mu=\int p(x) d\lambda$, which is absolutely continuous with respect to the Lebesgue measure $\lambda$. We endow S with a set of…

We construct a contractive, idempotent, MASA bimodule map on B(H), whose range is not a ternary subalgebra of B(H). Our method uses a crossed-product to reduce the existence of such an idempotent map to an analogous problem about the ranges…

With a f-left-invariant Riemannian metric on a Lie group $G$, we mean a Riemannian metric which is conformally equivalent to a left-invariant Riemannian metric, with the conformal factor $f$. In this article, we study the geometry of such…

In this paper we study the family of two-state Totalistic Freezing Cellular Automata (TFCA) defined over the triangular and square grids with von Neumann neighborhoods. We say that a Cellular Automaton is Freezing and Totalistic if the…

Relation between global transition function and local transition function of a homogeneous one dimensional cellular automaton (CA) is investigated for some standard transition functions. It could be shown that left shift and right shift CA…

We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other. The well…

We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be…

We consider the typical asymptotic behaviour of cellular automata of higher dimension (greater than 2). That is, we take an initial configuration at random according to a Bernoulli (i.i.d) probability measure, iterate some cellular…

The expanding cellular automata (XCA) variant of cellular automata is investigated and characterized from a complexity-theoretical standpoint. An XCA is a one-dimensional cellular automaton which can dynamically create new cells between…

For linear non-uniform cellular automata (NUCA) over an arbitrary universe, we introduce and investigate their dual linear NUCA. Generalizing results for linear CA, we show that dynamical properties namely pre-injectivity, resp.…

For a large class of nonuniformly expanding maps of $\Bbb R^m$, with indifferent fixed points and unbounded distorsion and non necessarily Markovian, we construct an absolutely continuous invariant measure. We extend to our case techniques…

Our concern is the behaviour of the elementary cellular automata with state set 0,1 over the cell set Z/nZ (one-dimensional finite wrap-around case), under all possible update rules (asynchronicity). Over the torus Z/nZ (n<= 11),we will see…

In this paper we consider cellular automata $(\mathfrak{G},\Phi)$ with algebraic local rules and such that $\mathfrak{G}$ is a topological Markov chain which has a structure compatible to this local rule. We characterize such cellular…

We show that a cellular automaton on a one-dimensional two-sided mixing subshift of finite type is a von Neumann regular element in the semigroup of cellular automata if and only if it is split epic onto its image in the category of sofic…

In this article we investigate the computational complexity of predicting two dimensional freezing majority cellular automata with states $\{-1,+1\}$, where the local interactions are based on an L-shaped neighborhood structure. In these…

Motivated by the search for idempotent cellular automata (CA), we study CA that act almost as the identity unless they read a fixed pattern $p$. We show that constant and symmetrical patterns always produce idempotent CA, and we…

We consider a class of non-locally compact groups on which one may define a left-invariant, finitely additive measure taking values in some finitely generated extension of the field $\mathbb{R}$ of real numbers. In particular, we recover…

In this dissertation, we study two of the global properties of 1-dimensional cellular automata (CAs) under periodic boundary condition, namely, reversibility and randomness. To address reversibility of finite CAs, we develop a mathematical…