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 published on a yearly basis
Papers
More filters
19 Oct 1997
TL;DR: The present paper constructs an asynchronous one-dimensional fault-tolerant cellular automaton, with the further feature of “self-organization,” which means that unless a large amount of input information must be given, the initial configuration can be chosen homogeneous.
Abstract: In a noisy cellular automaton, even if it is infinite, it is non-trivial to keep a bit of information for more than a constant number of steps. A clever solution in 2 dimensions has been applied to a simple 3-dimensional fault-tolerant cellular automaton. This technique did not solve the following problems: remembering a bit of information in 1 dimension; computing in dimensions lower than 3, or with non-synchronized transitions. With a more complex technique using a hierarchy of simulations, we construct an asynchronous one-dimensional reliable cellular automaton, which is also "self-organizing". This means that if the input information has constant size, the initial configuration can be homogenous: the hierarchy organizes itself. An application to information storage in positive-temperature Gibbs states is also given.
110 citations
06 Apr 1992
TL;DR: Four non-trivial characterizations of the languages accepted by a reversible automaton equipped with a set of initial and final states are given and it is shown that one can effectively decide whether a given rational (or regular) language can be accepted by the automaton.
Abstract: A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivial characterizations of the languages accepted by a reversible automaton equipped with a set of initial and final states and we show that one can effectively decide whether a given rational (or regular) language can be accepted by a reversible automaton. The first characterization gives a description of the subsets of the free group accepted by a reversible automaton that is somewhat reminiscent of Kleene's theorem. The second characterization is more combinatorial in nature. The decidability follows from the third — algebraic -characterization. The last characterization relates reversible automata to the profinite group topology of the free monoid.
108 citations
TL;DR: A learning algorithm is employed, the genetic algorithm, to search efficiently through a space of probabilistic CA rules for a local rule that best reproduces the observed behavior of the data.
107 citations
TL;DR: Criteria for surjectivity and injectivity of the global transition function of such a cellular automaton are presented and the question of reappearance of patterns for such cellular automata is also dealt with.
106 citations
Posted Content•
TL;DR: It is shown that the model is able to reproduce collective effects and self-organization phenomena encountered in pedestrian traffic, e.g. lane formation in counterflow through a large corridor and oscillations at doors.
Abstract: We present applications of a cellular automaton approach to pedestrian dynamics introduced in [1,2]. It is shown that the model is able to reproduce collective effects and self-organization phenomena encountered in pedestrian traffic, e.g. lane formation in counterflow through a large corridor and oscillations at doors. Furthermore we present simple examples where the model is applied to the simulation of evacuation processes.
104 citations