Topic
Cellular automaton
About: Cellular automaton is a research topic. Over the lifetime, 11479 publications have been published within this topic receiving 202954 citations. The topic is also known as: cellular space & tessellation automaton.
Papers published on a yearly basis
1 / 2
Papers
TL;DR: In this article, a class of information processing systems called cellular neural networks (CNNs) are proposed, which consist of a massive aggregate of regularly spaced circuit clones, called cells, which communicate with each other directly through their nearest neighbors.
Abstract: A novel class of information-processing systems called cellular neural networks is proposed. Like neural networks, they are large-scale nonlinear analog circuits that process signals in real time. Like cellular automata, they consist of a massive aggregate of regularly spaced circuit clones, called cells, which communicate with each other directly only through their nearest neighbors. Each cell is made of a linear capacitor, a nonlinear voltage-controlled current source, and a few resistive linear circuit elements. Cellular neural networks share the best features of both worlds: their continuous-time feature allows real-time signal processing, and their local interconnection feature makes them particularly adapted for VLSI implementation. Cellular neural networks are uniquely suited for high-speed parallel signal processing. >
4,876 citations
TL;DR: Analysis is given of ''elementary'' cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to p definite rules involving the values of its nearest neighbors.
Abstract: Cellular automata are used as simple mathematical models to investigate self-organization in statistical mechanics. A detailed analysis is given of "elementary" cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to definite rules involving the values of its nearest neighbors. With simple initial configurations, the cellular automata either tend to homogeneous states, or generate self-similar patterns with fractal dimensions \ensuremath{\simeq} 1.59 or \ensuremath{\simeq} 1.69. With "random" initial configurations, the irreversible character of the cellular automaton evolution leads to several self-organization phenomena. Statistical properties of the structures generated are found to lie in two universality classes, independent of the details of the initial state or the cellular automaton rules. More complicated cellular automata are briefly considered, and connections with dynamical systems theory and the formal theory of computation are discussed.
3,306 citations
TL;DR: Evidence is presented that all one-dimensional cellular automata fall into four distinct universality classes, and one class is probably capable of universal computation, so that properties of its infinite time behaviour are undecidable.
2,065 citations
1 Jan 1986
TL;DR: A water level monitor and alarm indicates when the drain valve in a toilet flush tank is improperly seated and water is not filling the flush tank as required.
1,992 citations
TL;DR: In this article, a two-dimensional cellular automaton model is proposed to simulate pedestrian tra c c. It is a vmax = 1 model with exclusion statistics and parallel dynamics, and long-range interactions between the pedestrians are mediated by a so-called "oor #eld which modi4es the transition rates to neighbouring cells.
Abstract: We propose a two-dimensional cellular automaton model to simulate pedestrian tra.c. It is a vmax = 1 model with exclusion statistics and parallel dynamics. Long-range interactions between the pedestrians are mediated by a so-called "oor #eld which modi4es the transition rates to neighbouring cells. This 4eld, which can be discrete or continuous, is subject to di7usion and decay. Furthermore it can be modi4ed by the motion ofthe pedestrians. Theref ore, the model uses an idea similar to chemotaxis, but with pedestrians following a virtual rather than a chemical trace. Our main goal is to show that the introduction ofsuch a :oor 4eld is su.cient to model collective e7ects and self-organization encountered in pedestrian dynamics, e.g. lane formation in counter:ow through a large corridor. As an application we also present simulations ofthe evacuation ofa large room with reduced visibility, e.g. due to f ailure oflights or smoke. c 2001 Elsevier Science B.V. All rights reserved.
1,898 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2026 | 4 |
| 2025 | 340 |
| 2024 | 585 |
| 2023 | 506 |
| 2022 | 1,160 |
| 2021 | 327 |