相关论文: Non-deterministic density classification with diff…

Search for extraterrestrial life and intelligence constitutes one of the major endeavors in science, but has yet been quantitatively modeled only rarely and in a cursory and superficial fashion. We argue that probabilistic cellular automata…

The paper proposes a simple formalism for dealing with deterministic, non-deterministic and stochastic cellular automata in a unifying and composable manner. Armed with this formalism, we extend the notion of intrinsic simulation between…

This paper presents a novel approach to the description and understanding of two-dimensional binary cellular automata with the Moore neighborhood that preserve the number of active cells. Such dynamical systems are known to successfully…

Probabilistic automata are an extension of nondeterministic finite automata in which transitions are annotated with probabilities. Despite its simplicity, this model is very expressive and many of the associated algorithmic questions are…

This paper studies the number conservation property of 1-dimensional non-uniform cellular automata (CAs). In a non-uniform cellular automaton (CA), different cells may follow different rules. The present work considers that the cells follow…

We introduce the property of pre-expansivity for cellular automata (CA): it is the property of being expansive on asymptotic pairs of configurations (i.e. configurations that differ in only finitely many positions). Pre-expansivity…

We investigate the conditions under which the mean-field formulation of a probabilistic, totalistic cellular automaton approximates the logistic equation. We show that this goal can be only fulfilled for an infinite-range neighborhood. We…

Probabilistic omega-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word can be defined in different ways: by requiring…

We explore the use of class-conditional autoregressive (CA) models to perform image classification on MNIST-10. Autoregressive models assign probability to an entire input by combining probabilities from each individual feature; hence…

For non-uniform cellular automata (NUCA) with finite memory over an arbitrary universe with multiple local transition rules, we show that pointwise nilpotency, pointwise periodicity, and pointwise eventual periodicity properties are…

We describe a class of cellular automata (CAs) that are end-to-end differentiable. DCAs interpolate the behavior of ordinary CAs through rules that act on distributions of states. The gradient of a DCA with respect to its parameters can be…

We study phase transitions in a long-range one-dimensional cellular automaton with two symmetric absorbing states. It includes and extends several other models, like the Ising and Domany-Kinzel ones. It is characterized by a competing…

Discovering interpretable patterns for classification of sequential data is of key importance for a variety of fields, ranging from genomics to fraud detection or more generally interpretable decision-making. In this paper, we propose a…

We search for regularities in the sequences of numbers of preimages for elementary cellular automata. For 46 out of 88 "minimal" rules, we find recognizable patterns, usually in the form of second order recurrence equations with constant…

We show techniques of analyzing complex dynamics of cellular automata (CA) with chaotic behaviour. CA are well known computational substrates for studying emergent collective behaviour, complexity, randomness and interaction between order…

We propose a four-way classification of two-dimensional semi-totalistic cellular automata that is different than Wolfram's, based on two questions with yes-or-no answers: do there exist patterns that eventually escape any finite bounding…

This study focuses on an extended model of a standard cellular automaton (CA) that includes an extra index consisting of a radius that defines a perception area for each cell in addition to the radius defined by the CA rule. Extended…

We focus on a family of one-dimensional probabilistic cellular automata with memory two: the dynamics is such that the value of a given cell at time $t+1$ is drawn according to a distribution which is a function of the states of its two…

We explain how effective automatic probability density function estimates can be constructed using contemporary Bayesian inference engines such as those based on no-U-turn sampling and expectation propagation. Extensive simulation studies…

When modeling a probability distribution with a Bayesian network, we are faced with the problem of how to handle continuous variables. Most previous work has either solved the problem by discretizing, or assumed that the data are generated…