Related papers: A non-ergodic probabilistic cellular automaton wit…
A cellular automaton (CA) is a parallel synchronous computing model, which consists in a juxtaposition of finite automata (cells) whose state evolves according to that of their neighbors. Its trace is the set of infinite words representing…
Principal Component Analysis (PCA) is a well known procedure to reduce intrinsic complexity of a dataset, essentially through simplifying the covariance structure or the correlation structure. We introduce a novel algebraic, model-based…
In this work we provide analytic results of infinite one-dimensional cellular automaton(CA). By realizing symbolic products, we investigate a subclass of infinite CA and prove analytically that within this subclass the only allowed…
In this paper, the author aims to establish a mathematical model for a mimic computer. To this end, a novel automaton is proposed. First, a one-dimensional cellular automaton is used for expressing some dynamic changes in the structure of a…
We investigate second order additive invariants in elementary cellular automata rules. Fundamental diagrams of rules which possess additive invariants are either linear or exhibit singularities similar to singularities of rules with…
Certain fermionic quantum field theories are equivalent to probabilistic cellular automata, with fermionic occupation numbers associated to bits. We construct an automaton that represents a discrete model of spinor gravity in four…
Both cellular automata (CA) and lattice-gas automata (LG) provide finite algorithmic presentations for certain classes of infinite dynamical systems studied by symbolic dynamics; it is customary to use the term `cellular automaton' or…
Random boolean cellular automata are investigated, where each gate has two randomly chosen inputs and is randomly assigned a boolean function of its inputs. The effect of non-uniform distributions on the choice of the boolean functions is…
It is known that no-boundary Cellular Automata (CA) defined by bipermutive local rules give rise to Latin squares. In this paper, we study under which conditions the Latin square generated by a bipermutive CA is self-orthogonal, i.e.…
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quantum machine: it has to be unitary, that is its time evolution…
Principal Component Analysis (PCA) is a method for estimating a subspace given noisy samples. It is useful in a variety of problems ranging from dimensionality reduction to anomaly detection and the visualization of high dimensional data.…
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,…
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours and a celebrated result is the existence of (intrinsically)…
Failure to find homogeneous scalar unitary cellular automata (CA) in one dimension led to consideration of only ``approximately unitary'' CA---which motivated our recent proof of a No-go Lemma in one dimension. In this note we extend the…
In this paper we introduce a new quantum computation model, the linear quantum cellular automaton. Well-formedness is an essential property for any quantum computing device since it enables us to define the probability of a configuration in…
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…
Ergodic properties and asymptotic stationarity are investigated in this paper for the pseudo-covariance matrix (PCM) of a recursive state estimator which is robust against parametric uncertainties and is based on plant output measurements…
PCA can be used for rotation invariant features, describing a shape with its $p_{ab}=E[(x_i-E[x_a])(x_b-E[x_b])]$ covariance matrix approximating shape by ellipsoid, allowing for rotation invariants like its traces of powers. However, real…
We prove that for certain partially hyperbolic skew-products, non-uniform hyperbolicity along the leaves implies existence of a finite number of ergodic absolutely continuous invariant probability measures which describe the asymptotics of…
We consider a left permutive cellular automaton Phi, with no memory and positive anticipation, defined on the space of all doubly infinite sequences with entries from a finite alphabet. For each such automaton that is not one-to-one, there…