scispace - formally typeset
Search or ask a question
Topic

Continuous automaton

About: Continuous automaton is a research topic. Over the lifetime, 947 publications have been published within this topic receiving 17417 citations.


Papers
More filters
Journal ArticleDOI
30 Nov 1998-Chaos
TL;DR: The phenomenon of synchronization in pairs of cellular automata coupled in a driver-replica mode is studied and necessary and sufficient conditions for synchronization in linear cellular automaton pairs are given.
Abstract: The phenomenon of synchronization in pairs of cellular automata coupled in a driver–replica mode is studied. Necessary and sufficient conditions for synchronization in linear cellular automaton pairs are given. The couplings that make a pair synchronize are determined for all linear elementary cellular automata.

19 citations

Journal ArticleDOI
TL;DR: This paper indicates in this Note how one may construct a computation and construction universal, concurrent, asynchronous, cellular automaton where no overlapping can possibly occur.

19 citations

Journal ArticleDOI
Maurice Margenstern1
TL;DR: A new weakly universal cellular automaton on the ternary heptagrid with four states is constructed, which is the best result up to date for cellular automata in the hyperbolic plane, with true planar motions.

19 citations

Journal ArticleDOI
TL;DR: This paper gives an efficient algorithm for drawing a straight line through two given points in a digitized picture, where the picture is stored one pixel per processor at the base of a pyramid cellular automaton (PCA).

18 citations

Journal ArticleDOI
TL;DR: In this article, the use of particles and collisions for constructions involving an infinite number of interacting particles was investigated and a high-level construction for a new smallest intrinsically universal cellular automaton with 4 states was obtained.
Abstract: Signals are a classical tool used in cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collisions formalize this idea one step further, describing regular nets of colliding signals. In the present paper, we investigate the use of particles and collisions for constructions involving an infinite number of interacting particles. We obtain a high-level construction for a new smallest intrinsically universal cellular automaton with 4 states.

18 citations

Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
81% related
Graph (abstract data type)
69.9K papers, 1.2M citations
77% related
Approximation algorithm
23.9K papers, 654.3K citations
77% related
Graph theory
20.8K papers, 691.4K citations
76% related
Computational complexity theory
30.8K papers, 711.2K citations
76% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20232
202219
20212
20192
20184
201719