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
26 Jun 2004
TL;DR: This papers provides elements of answer, as it describes how another universal cellular automaton than the Game of Life (Life) was sought and found using evolutionary algorithms.
Abstract: In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers provides elements of answer, as it describes how another universal cellular automaton than the Game of Life (Life) was sought and found using evolutionary algorithms. This paper includes a demonstration that consists in showing that the presented R automaton can both implement any logic circuit (logic universality) and a simulation of Life (universality in the Turing sense).
26 citations
01 Apr 2001
TL;DR: It is shown that a set of two-dimensional connected binary images of size m×n can be recognized in 2(m+n)+O(1) steps by a two- dimensional CA with 1-bit inter-cell communication.
Abstract: We introduce a new class of two-dimensional cellular automata (CAs) whose inter-cell communication is restricted to 1-bit and propose a linear-time connectivity recognition algorithm for two-dimensional binary images Precisely, it is shown that a set of two-dimensional connected binary images of size m×n can be recognized in 2(m+n)+O(1) steps by a two-dimensional CA with 1-bit inter-cell communication
26 citations
TL;DR: If an array language is generated by an RPCA, it can be parsed in parallel by a deterministic inverse PCA without backtracking, and the characteristic of PCAAG is that a “reversible” version is easily defined.
Abstract: We propose a new system of generating array languages in parallel, based on a partitioned cellular automaton (PCA), a kind of cellular automaton. This system is called a PCA array generator (PCAAG). The characteristic of PCAAG is that a “reversible” version is easily defined. A reversible PCA (RPCA) is a backward deterministic PCA, and we can construct a deterministic “inverse” PCA that undoes the operations of the RPCA. Thus if an array language is generated by an RPCA, it can be parsed in parallel by a deterministic inverse PCA without backtracking. We also define two subclasses of PCAAG, and give examples of them that generate geometrical figures.
26 citations
22 Feb 1996
TL;DR: In this article, the authors introduce the linear quantum cellular automaton (LQCA) model and give an efficient algorithm to decide if a cellular automata is well-formed.
Abstract: In this paper we introduce a new quantum computation model, the linear quantum cellular automaton. Well-formedness is an essential property for any quantum computing device since it enables us to define the probability of a configuration in an observation as the squared magnitude of its amplitude. We give an efficient algorithm which decides if a linear quantum cellular automaton is well-formed. The complexity of the algorithm is O(n2) if the input automaton has continuous neighborhood.
25 citations
TL;DR: By estimating the number of regular expressions that have e as a partial derivative, a lower bound of the average number of mergings of states in and its asymptotic behaviour is computed.
Abstract: The partial derivative automaton () is usually smaller than other nondeterministic finite automata constructed from a regular expression, and it can be seen as a quotient of the Glushkov automaton (). By estimating the number of regular expressions that have e as a partial derivative, we compute a lower bound of the average number of mergings of states in and describe its asymptotic behaviour. This depends on the alphabet size, k, and for growing k's its limit approaches half the number of states in . The lower bound corresponds to consider the automaton for the marked version of the regular expression, i.e. where all its letters are made different. Experimental results suggest that the average number of states of this automaton, and of the automaton for the unmarked regular expression, are very close to each other.
25 citations