Continuous automaton

About: Continuous automaton is a research topic. Over the lifetime, 947 publications have been published within this topic receiving 17417 citations.

Numerical study of a generalized domany-kinzel probabilistic one-dimensional cellular automaton

Abstract: We use Monte Carlo simulation to study a generalization (in order to include the anisotropic case) of the Domany-Kinzel like probabilistic one-dimensional Cellular Automaton. We show the connection between the parameters of this probabilistic Cellular Automaton and the 16 possible deterministic local rules. Critical surface and universality classes are obtained. In particular, our simulations indicate that the anisotropic case belongs to a universality class different from the isotropic one. Its sensitivity to initial conditions yields clear evidence of a new chaotic phase.

Two points of view to study the iterates of a random configuration by a cellular automaton.

Abstract: We study the dynamics of the action of cellular automata on the set of shiftinvariant probability measures according two points of view. First, the robustness of the simulation of a cellular automaton on a random configuration can be viewed considering the sensitivity to initial condition in the space of shift-invariant probability measures. Secondly we consider the evolution of the quantity of information in the orbit of a random initial state.

Formation of streams of binary sequences with controlled structure of "cellular" automata in homogeneous register environments

Abstract: Objective. Development of a method for organizing the process of forming flows register structure, patented by the author at the Department of DSTU, which is a cellular automaton of binary sequences with a controlled structure of "cellular" automata in homogeneous register environments. Method. To solve the set system problem, a process model was built in order to determine the factors that allow changing the sequence of flow elements. Result. When studying the most common generators of pseudo-random streams based on linear register media with modulo two adders in feedback circuits, which are "cellular" automata, it was established from the tables of environment states that the factors determining the structure of the generated streams of binary sequences are the sequence of states , are the initial state of the register of a homogeneous medium and the feedback structure determined by the transition function of the cellular automaton. Conclusion. It is shown that by varying the initial state of the cellular automaton and the structure of feedbacks as control tools, it seems possible to form binary pseudo-random streams of states with different structures, different order of flow elements, bringing their characteristics closer to random ones. Examples of the implementation of the flow structure control process are given, confirming this assumption. A typical structure of a stream shaper with a managed structure based on a homogeneous one is given.

An Analysis and Simulation of Cellular Automaton

Abstract: The life evolutionary model is researched and simulated as well as other typical cellular automaton model. Different consequences are simulated with various cell numbers, different initial states and different evolution rules. After results comparison among these methods, the factors impacting stability are analyzed. Results show that the complexity of cellular automaton can provide a simple and visual tool for the theory of complexity science.

On the computation power of finite automata in two-dimensional environments

Abstract: In this paper we study the model of a finite state automaton interacting with infinite two-dimensional geometric environments. We show that the reachability problem for a finite state automaton interacting with a quadrant of the plane extended by a power function, a polynomial function or a linear function is algorithmically undecidable, by simulating a Minsky machine. We also consider the environment defined by a parabola which impedes the direct simulation of multiplication. However we show that the model of a finite automaton interacting inside a parabola is also universal.