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
Posted Content
Henryk Fuks1
TL;DR: In this paper, the authors investigate the dynamics of the cellular automaton rule 142 and show that at the density of blocks 10 equal to 0.25, the rule 142 exhibits a phenomenon similar to the jamming transitions occurring in discrete models of traffic flow.
Abstract: We investigate dynamics of the cellular automaton rule 142. This rule possesses additive invariant of the second order, namely it conserves the number of blocks 10. Rule 142 can be alternatively described as an operation on a binary string in which we simultaneously flip all symbols which have dissenting right neighbours. We show that the probability of having a dissenting neighbour can be computed exactly using the fact that the surjective rule 60 transforms rule 142 into rule 226. We also demonstrate that the conservation of the number of 10 blocks implies that these blocks move with speed -1 or stay in the same place, depending on the state of the preceding site. At the density of blocks 10 equal to 0.25, the rule 142 exhibits a phenomenon similar to the jamming transitions occurring in discrete models of traffic flow.

1 citations

Journal Article
Qin Da-kang1
TL;DR: The result shows that the finite automaton can accept this limit set of elementary cellular automaton and its regularity is proved.
Abstract: The limit set of elementary cellular automaton is found through defining some kinds of particles and its regularity is proved.The result shows that the finite automaton can accept this limit set.

1 citations

Journal ArticleDOI
TL;DR: It is concluded that the results that are obtained make it possible to construct an analogue of the statistics collection procedure for the field of fuzzy systems, based on a theory that generalizes Markov chains and the axiomatic description of operations with fuzzy evidence.
Abstract: The behavior of M.L. Tsetlin's automaton with linear tactics in a fuzzy environment is considered. The behavior of such an automaton was previously studied in a random environment, where the classical apparatus of probabilistic Markov chains could be used. This work is based on two results that were previously obtained by the author, namely, a theory that generalizes Markov chains and the axiomatic description of operations with fuzzy evidence. The explicit formulas for describing the behavior of the automaton that were obtained in this paper suggest a deep analogy with the results of M.L. Tsetlin. In particular, it is shown that this automaton in a fuzzy environment also has the property of asymptotic optimality. As an application, we discuss the possibility of using this property to measure membership functions for values that are similar to singletons or point functions. It is concluded that the results that are obtained in this paper make it possible to construct an analogue of the statistics collection procedure for the field of fuzzy systems.

1 citations

Proceedings ArticleDOI
01 Nov 2016
TL;DR: A novel BCA based on a conventional ACA, which employs a smaller number of rules as compared to the previous model, is proposed, capable of universal computing which might demonstrate the crucial role of signal random fluctuation for reducing the complexity of universal ACAs.
Abstract: A Brownian cellular automaton (BCA) is an asynchronous cellular automaton (ACA) in which the local configurations representing signals may fluctuate randomly in the cell space. The random fluctuation of signals enables effective stochastic search to conduct computation, which can actually result in the decreased complexity of BCAs. This paper proposes a novel BCA based on a conventional ACA, which employs a smaller number of rules as compared to the previous model. This BCA is capable of universal computing which might demonstrate the crucial role of signal random fluctuation for reducing the complexity of universal ACAs.

1 citations

Journal Article
TL;DR: In this paper the notions of fuzzy minimal automaton and reduced fuzzy automaton are introduced, the relationship among fuzzy minimal Automaton, rational fuzzy language and reduced fuzzier language are discussed and several important results are obtained.
Abstract: In this paper the notions of fuzzy minimal automaton and reduced fuzzy automaton are introduced, the relationship among fuzzy minimal automaton, rational fuzzy language and reduced fuzzy automaton are discussed, several important results are obtained.

1 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