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 linear context-free language which is not acceptable by a finite probabilistic automaton is given, and it is shown that the family of stochastic languages is not closed under concatenation and homomorphism.
Abstract: A linear context-free language which is not acceptable by a finite probabilistic automaton is given, and it is shown that the family of stochastic languages is not closed under concatenation and homomorphism.

32 citations

Journal ArticleDOI
Zsuzsanna Róka1
TL;DR: It is shown that, if there exists a homomorphism with a finite kernel from a group into another one such that the image of the first group has a finite index in the second one, then every cellular automaton on the Cayley graph of one of these groups can be uniformly simulated by a cellular automata on the Bayesian graph of the other one.

32 citations

Journal ArticleDOI
TL;DR: This paper demonstrates that the one-dimensional three-color cyclic cellular automaton clusters, and the mean cluster size, as a function of time t, is asymptotic to ct1/2, where c is an explicitly calculable constant.
Abstract: cyclic cellular automaton. The author has previously shown that this process fluctuates, meaning that each lattice site changes color infinitely often, so that there is no "final state" for the system. The focus of the current work is on the clustering properties of this system. This paper demonstrates that the one-dimensional three-color cyclic cellular automaton clusters, and the mean cluster size, as a function of time t, is asymptotic to ct1/2, where c is an explicitly calculable constant. The method of proof also allows us to compute asymptotic estimates of the mean interparticle distance for a one-dimensional system of particles which undergo deterministic motion and which annihilate upon collision. No clustering results are known about the four-color process, but evidence is presented to suggest that the mean cluster size of such systems grows at a rate different from t1/2.

32 citations

Book ChapterDOI
01 Jan 2001
TL;DR: In this article, the game of life cellular automaton is used to construct basic logical operations, such as AND, OR, NOT in space-time configurations of cellular automata.
Abstract: The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generators of the mobile patterns, glider guns, in its evolution. We show how to construct basic logical operations, AND, OR, NOT in space-time configurations of the cellular automaton. Also decomposition of complicated Boolean functions is discussed. Advantages of our technique are demonstrated on an example of binary adder, realized via collision of gliders’ streams.

32 citations

Journal ArticleDOI
TL;DR: A general methodology is developed to compute the solution of a wide variety of basic counting problems in a uniform way by means of an infinite weighted automaton.
Abstract: A general methodology is developed to compute the solution of a wide variety of basic counting problems in a uniform way: (1) the objects to be counted are enumerated by means of an infinite weighted automaton; (2) the automaton is reduced by means of the quantitative notion of stream bisimulation; (3) the reduced automaton is used to compute an expression (in terms of stream constants and operators) that represents the stream of all counts.

32 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