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
TL;DR: A cellular automaton, with two states per site and with a probabilistic behaviour for the transition, is studied and a reanimation factor ϵ is introduced along with a factor p related to the probability of the transition.

3 citations

Journal ArticleDOI
TL;DR: This work surveys three applications that use finite automata to specify behaviors of concurrent processes in general, and asynchronous circuits in particular, and describes a BDD-based tool that implements the respective automata and operations.

3 citations

Journal Article
TL;DR: HFCAI is useful for computing growth in evolutionary systems which are also affected by external cause and is included in the class of language accepted by linear hybrid fuzzy cellular automata with external input.
Abstract: A linear array of interconnected fuzzy automaton is called linear fuzzy cellular automaton. It is shown that the language class of linear fuzzy cellular automata strictly contains the language class of linear cellular automata. This justifies the wide spread use of linear fuzzy cellular automaton as is evident from the literature. In this paper a special type of cellular automaton (CA) model is investigated. This CA model computes effect due to interaction of neighboring cells and effect due to external disturbance on the cells simultaneously. The transition due to both the effects may be represented by a single function which is the composition of two functions. Further it is shown that the class of language accepted by linear hybrid fuzzy cellular automata is included in the class of language accepted by linear hybrid fuzzy cellular automata with external input(HFCAI). HFCAI is useful for computing growth in evolutionary systems which are also affected by external cause.

3 citations

Journal ArticleDOI
TL;DR: An algorithm is introduced that grows planar, tri-valent graphs by exhibiting a peculiar, twofold dynamics by providing a finite, but surprisingly long, pseudo-random, linear growth process.

3 citations

Proceedings ArticleDOI
31 Mar 2009
TL;DR: Comparisons among solid CA modeling result, finite element method modeling result and analytical result indicate that the solid CA is a reliable method in the solution of physical field.
Abstract: This paper introduces a new computational technique—solid cellular automaton—for the solution of physical field. The thought of cellular automaton comes from the self-organization theory in biology. In this theory, the state of a cell is determined by the states of itself and its neighbors. The information outside the neighbor domain does not contribute to the state of the cell. The global analysis of structure is converted to a series of local analyses by using the idea of cellular automaton. Based on the control equations in physical field, the updating rule to describe the relation between cell and its neighbors is developed. This method is used to the analysis of fluid flow and the computational steps as well as the results are presented. Comparisons among solid CA modeling result, finite element method modeling result and analytical result indicate that the solid CA is a reliable method in the solution of physical field.

3 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