Related papers: On beta-skeleton automata with memory

Here I describe a view of the evolution of cellular automata that allows to operate on larger structures. Instead of calculating the next state of all cells in one step, the method here developed uses a time slice that can proceed at…

A robot operating in a household makes observations of multiple objects as it moves around over the course of days or weeks. The objects may be moved by inhabitants, but not completely at random. The robot may be called upon later to…

Fekete's lemma is a well known combinatorial result on number sequences: we extend it to functions defined on $d$-tuples of integers. As an application of the new variant, we show that nonsurjective $d$-dimensional cellular automata are…

Skeleton-based human action recognition has achieved a great interest in recent years, as skeleton data has been demonstrated to be robust to illumination changes, body scales, dynamic camera views, and complex background. Nevertheless, an…

Metastability is observed when a physical system is close to a first order phase transition. In this paper the metastable behavior of a two state reversible probabilistic cellular automaton with self-interaction is discussed. Depending on…

In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information indefinitely is nontrivial, even in an infinite automaton. Still, there is a solution in 2…

The basis for most of the ideas mentioned in this paper is the theory of cellular automata. A cellular automata contains a regular grid of cells, with each cell having a pre-defined set of finite states. The initial state is determined at…

A new kind of cellular automaton (CA) for the study of the dynamics of urban systems is proposed. The state of a cell is not described using a finite set, but by means of continuum variables. A population sector is included, taking into…

We consider random boolean cellular automata on the integer lattice, i.e., the cells are identified with the integers from 1 to $N$. The behaviour of the automaton is mainly determined by the support of the random variable that selects one…

Cellular Automata (CA) are a class of discrete dynamical systems that have been widely used to model complex systems in which the dynamics is specified at local cell-scale. Classically, CA are run on a regular lattice and with perfect…

Automata networks, and in particular Boolean networks, are used to model diverse networks of interacting entities. The interaction graph of an automata network is its most important parameter, as it represents the overall architecture of…

A complete deterministic finite automaton in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize completely…

Statistical modeling of nuclear data provides a novel approach to nuclear systematics complementary to established theoretical and phenomenological approaches based on quantum theory. Continuing previous studies in which global statistical…

Controllability is one of the central concepts of modern control theory that allows a good understanding of a system's behaviour. It consists in constraining a system to reach the desired state from an initial state within a given time…

We present a 2-dimensional cellular automaton model for the simulation of pedestrian dynamics. The model is extremely efficient and allows simulations of large crowds faster than real time since it includes only nearest-neighbour…

Three reasonable hypotheses lead to the thesis that physical phenomena can be described and simulated with cellular automata. In this work, we attempt to describe the motion of a particle upon which a constant force is applied, with a…

Gravitational clustering of a random distribution of point masses is dominated by the effective short-range interactions due to large-scale isotropy. We introduce a one-dimensional cellular automaton to reproduce this effect in the most…

In this paper we study the dynamics of 1- and 2- dimensional cellular automata, using a 2-adic representation of the states, we give a simple graphical technique for finding periodic solutions. We also study the continuity properties of the…

These lecture notes cover basic automata-theoretic concepts and logical formalisms for the modeling and verification of concurrent and distributed systems. Many of these concepts naturally extend the classical automata and logics over…

Embedding learning, a.k.a. representation learning, has been shown to be able to model large-scale semantic knowledge graphs. A key concept is a mapping of the knowledge graph to a tensor representation whose entries are predicted by models…