Related papers: Probabilistic initial value problem for cellular a…
In this paper, we present a novel algorithm to optimize the design of Reservoir Computing using Cellular Automata models for time series applications. Besides selecting the models' hyperparameters, the proposed algorithm particularly solves…
Probing the ability of automata networks to solve decision problems has received a continuous attention in the literature, and specially with the automata reaching the answer by distributed consensus, i.e., their all taking on a same state,…
In this paper, we study linear cellular automata (CAs) on Cayley tree of order 2 over the field $\mathbb F_p$ (the set of prime numbers modulo $p$). We construct the rule matrix corresponding to finite cellular automata on Cayley tree.…
The Majority (or Density Classification) Problem in Cellular Automata (CA) aims to converge a string of cells to a final homogeneous state which reflects the majority of states present in the initial configuration. The problem is…
Performance measurement is an essential task once a statistical model is created. The Area Under the receiving operating characteristics Curve (AUC) is the most popular measure for evaluating the quality of a binary classifier. In this…
We propose a novel approach to model selection for simulator-based statistical models. The proposed approach defines a mixture of candidate models, and then iteratively updates the weight coefficients for those models as well as the…
We study a Life-like cellular automaton rule $B2/S2345$ where a cell in state `0' takes state `1' if it has exactly two neighbors in state `1' and the cell remains in the state `1' if it has between two and five neighbors in state `1.' This…
We propose a characteristic representation ofone-dimensional and 2-state, 3-neighbor cellular automaton rules, which describes an effective form of each rule after many time steps. Simulated results of the representation show that complex…
It has been shown that uniform as well as non-uniform cellular automata (CA) can be evolved to perform certain computational tasks. Random Boolean networks are a generalization of two-state cellular automata, where the interconnection…
We give recurrences, generating functions and explicit exact expressions for the enumeration of fundamental quantities involving runs in binary strings. We first focus on enumerations concerning runs of ones, and we then analyse the same…
We investigate Boolean, totalistic cellular automata with a majority or frustrated majority vote rule, and an interaction range of variable span. These two models show a behavior which differs from the mean-field one. The majority vote…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…
We propose and investigate a probabilistic model of sublinear-time one-dimensional cellular automata. In particular, we modify the model of ACA (which are cellular automata that accept if and only if all cells simultaneously accept) so that…
A Cellular Automata (CA) rule is presented that can generate "loop patterns" in a 2D grid under fixed boundary conditions. A loop is a cyclically closed path represented by one-cells enclosed by zero-cells. A loop pattern can contain…
Abelian cellular automata (CA) are CA which are group endomorphisms of the full group shift when endowing the alphabet with an abelian group structure. A CA randomizes an initial probability measure if its iterated images weak *-converge…
While one-dimensional cellular automata have been well studied, there are relatively few results about multidimensional cellular automata; the investigation of cellular automata defined on Cayley trees constitutes an intermediate class.…
Uncertainty often plays an important role in dynamic flow problems. In this paper, we consider both, a stationary and a dynamic flow model with uncertain boundary data on networks. We introduce two different ways how to compute the…
In this paper a method is proposed which uses data mining techniques based on rough sets theory to select neighborhood and determine update rule for cellular automata (CA). According to the proposed approach, neighborhood is detected by…