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
Dissertation
01 Jan 2006
TL;DR: This work introduces two CA models for Turing-type pattern formation, a moving average CA and lattice-gas CA, and a modified reaction rule for an activator-inhibitor system and combine it with the propagation rule and shuffling rule.
Abstract: A cellular automaton (CA) is a discrete microscopic dynamical system widely used to investigate and understand the mechanisms of complex systems such as reactiondiffusion systems based on cell-cell interactions. We introduce two CA models for Turing-type pattern formation. These are a moving average CA and lattice-gas CA. For a moving average CA, the construction of the local CA rules from the reactiondiffusion partial differential equations relies on a moving-average procedure to implement the diffusive step and a probabilistic table lookup for the reactive step. We apply this method to the 2D Brusselator system. The corresponding 11-state CA model is able to capture the Hopf and Turing birfucation. For a lattice-gas CA, we introduce a modified reaction rule for an activator-inhibitor system and combine it with the propagation rule and shuffling rule. A variety of dynamics arise in this LGCA model. Numerical simulations of both CA models are presented and analyzed.

2 citations

Journal ArticleDOI
TL;DR: In this paper, a topological design of two-dimensional structure by cellular automata is presented, where the cell can be in two states, namely alive or dead, and a simple local rule based on the equivalent stress is used to generate or eliminate cells.
Abstract: The present paper djscribes a topological design of two-dimensional structure by cellular automaton. To solve the two-dimensional elastic problem, we use the finite element method. At the application of the cellular automaton, the element of the finite element method is regarded as cell. The cell can be in the two states, namely alive or dead. To generate or eliminate cells, we make a simple local rule based on the equivalent stress. Numerical simulation shows the various topologies of the structure in a prescribed design domain under the various local rules. Also, we discuss how the initial designs of the structure have affect to the final topology.

2 citations

Proceedings Article
01 Jan 1998
TL;DR: This paper describes here a parallel implementation of a hardware Deterministic Finite State Automaton processor that can rapidly search a large database for approximately matching strings, as a lter for more detailed processing later.
Abstract: Finite State Automata are useful for string searching problems mostly because they are fast. For very large problems, a software implementation will not be fast enough. I describe here a parallel implementation of a hardware Deterministic Finite State Automaton processor. It can rapidly search a large database for approximately matching strings, as a lter for more detailed processing later. As the most important parts, large Random Access Memory chips, are continually getting cheaper, it should be possible and a ordable to make large arrays of such processors.

2 citations

Book ChapterDOI
01 Jan 2010
TL;DR: A computationally universal square lattice asynchronous cellular automaton, in which cells have merely two states, which is inner-independent—a property according to which a cell’s state does not depend on its previous state, but merely on the states of cells in its neighborhood.
Abstract: This paper proposes a computationally universal square lattice asynchronous cellular automaton, in which cells have merely two states. The transition function according to which a cell is updated takes as its arguments the states of the cells at orthogonal or diagonal distances 1 or 2 from the cell. The proposed cellular automaton is inner-independent—a property according to which a cell’s state does not depend on its previous state, but merely on the states of cells in its neighborhood. Playing a role in classical spin systems, inner-dependence has only been investigated in the context of synchronous cellular automata. The asynchronous update mode used in this paper allows an update of a cell state to take place—but only so with a certain probability—whenever the cell’s neighborhood states matches an element of the transition function’s domain. Universality of the model is proven through the construction of three circuit primitives on the cell space, which are universal for the class of Delay-Insensitive circuits.

2 citations

Journal Article
TL;DR: The rule matrix of a 2-dimensional cellular automaton generated by a new local rule with the nearest neighborhoods and prolonged next nearest neighborhoods under periodic boundary condition over the ternary field is obtained.
Abstract: In this paper, we study a 2-dimensional cellular automaton generated by a new local rule with the nearest neighborhoods and prolonged next nearest neighborhoods under periodic boundary condition over the ternary field (Z 3). We obtain the rule matrix of this cellular automaton and characterize this family by exploring some of their important characteristics. We get some recurrence equations which simplifies the computation of the rank of the rule matrix related to the 2-dimensional cellular automaton drastically. Next, we propose an algorithm to determine the rank of the rule matrix. Finally, we conclude by presenting an application to error correcting codes.

2 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