English
Related papers

Related papers: Solving two-dimensional density classification pro…

200 papers

We propose and investigate a one-parameter probabilistic mixture of one-dimensional elementary cellular automata under the guise of a model for the dynamics of a single-species unstructured population with nonoverlapping generations in…

Statistical Mechanics · Physics 2018-03-09 J. Ricardo G. Mendonça

The jam phases in a two-dimensional cellular automata model of traffic flow are investigated by computer simulations. Two different types of the jam phases are found. The spatially diagonal long-range correlation obeys the power law at the…

patt-sol · Physics 2009-10-28 Shin-ichi Tadaki , Macoto Kikuchi

We investigate critical properties of a class of number-conserving cellular automata (CA) which can be interpreted as deterministic models of traffic flow with anticipatory driving. These rules are among the only known CA rules for which…

Cellular Automata and Lattice Gases · Physics 2023-12-18 Henryk Fuks

Lagging or halted traffic is bothersome. As such, it is desirable to have a model that can begin to determine the efficiency of various traffic standardizations. Our model intended to create a multifaceted realistic simulation of traffic…

Cellular Automata and Lattice Gases · Physics 2018-03-28 Camilla Champion , Cody Champion

One-dimensional cellular automata are discrete dynamical systems that operate on an infinite lattice of sites and are characterized by the locality and uniformity of their update rule. Permutations of the state set and isometric…

Cellular Automata and Lattice Gases · Physics 2025-12-10 Martin Schaller , Karl Svozil

We use cellular automata model to study the cooperation between cyclists. In the two-lane model, cyclists can change lanes. Even there is someone on the back they will take a cooperative attitude. It means that they will be in a same…

Cellular Automata and Lattice Gases · Physics 2011-10-14 Chi-Yu Wang , Li-Hu Wang , Ruo-Hang Chen

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…

Probability · Mathematics 2024-01-26 Peter Gacs

We propose a novel density based numerical method for uncertainty propagation under certain partial differential equation dynamics. The main idea is to translate them into objects that we call cellular probabilistic automata and to evolve…

Numerical Analysis · Mathematics 2013-02-06 Dominic Kohler , Johannes Müller , Utz Wever

Recent experiments by Springer and Kenyon have shown that a deep neural network can be trained to predict the action of $t$ steps of Conway's Game of Life automaton given millions of examples of this action on random initial states.…

Cellular Automata and Lattice Gases · Physics 2021-09-08 Veit Elser

Within the class of stochastic cellular automata models of traffic flows, we look at the velocity dependent randomization variant (VDR-TCA) whose parameters take on a specific set of extreme values. These initial conditions lead us to the…

Cellular Automata and Lattice Gases · Physics 2007-05-23 Sven Maerivoet , Bart De Moor

We study the statistical properties of a cellular automata model of traffic flow with the look-ahead potential. The model defines stochastic rules for the movement of cars on a lattice. We analyze the underlying statistical assumptions…

Probability · Mathematics 2012-09-27 Cory Hauck , Yi Sun , Ilya Timofeyev

We investigate a probabilistic cellular automaton model which has been introduced recently. This model describes single-lane traffic flow on a ring and generalizes the asymmetric exclusion process models. We study the equilibrium properties…

Condensed Matter · Physics 2009-10-22 M. Schreckenberg , A. Schadschneider , K. Nagel , N. Ito

In recent years the modelling of traffic flow using methods from statistical physics, especially cellular automata models have allowed simulations of large traffic networks faster than real time. In this paper, we study a probabilistic…

Soft Condensed Matter · Physics 2007-05-23 M. E. Larraga , J. A. del Rio

We study the influence of the dimension of cellular automata (CA) for real time language recognition of one-dimensional languages with parallel input. Specifically, we focus on the question of determining whether every language that can be…

Formal Languages and Automata Theory · Computer Science 2016-10-04 Anaël Grandjean , Victor Poupet

We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…

Cellular Automata and Lattice Gases · Physics 2007-12-13 Jean-Baptiste Rouquier , Michel Morvan

The local structure theory for cellular automata (CA) can be viewed as an finite-dimensional approximation of infinitely-dimensional system. While it is well known that this approximation works surprisingly well for some cellular automata,…

Cellular Automata and Lattice Gases · Physics 2026-01-05 Henryk Fukś , Yucen Jin

We propose a method for deriving networks from one-dimensional binary cellular automata. The derived networks are usually directed and have structural properties corresponding to the dynamical behaviors of their cellular automata. Network…

Cellular Automata and Lattice Gases · Physics 2010-09-28 Yoshihiko Kayama

A two-lane extension of a recently proposed cellular automaton model for traffic flow is discussed. The analysis focuses on the reproduction of the lane usage inversion and the density dependence of the number of lane changes. It is shown…

Statistical Mechanics · Physics 2009-11-07 W. Knospe , L. Santen , A. Schadschneider , M. Schreckenberg

A two-dimensional cellular automaton model of traffic flow with open boundaries are investigated by computer simulations. The outflow of cars from the system and the average velocity are investigated. The time sequences of the outflow and…

adap-org · Physics 2009-10-28 Shin-ichi Tadaki

Consider a graph $G=(V,E)$ and a random initial vertex-coloring, where each vertex is blue independently with probability $p_{b}$, and red with probability $p_r=1-p_b$. In each step, all vertices change their current color synchronously to…

Formal Languages and Automata Theory · Computer Science 2017-11-30 Bernd Gärtner , Ahad N. Zehmakan