相关论文: Synchronization and Maximum Lyapunov Exponents of …
We characterize synchronization phenomenon in discrete-time, discrete-state random dynamical systems, with random and probabilistic Boolean networks as particular examples. In terms of multiplicative ergodic properties of the induced linear…
In this letter we consider a prototype model which is described as an autonomous continuous time delayed differential equation with just one variable. The chaos has been investigated with variable delay time and the synchronization…
We investigate synchronization in the presence of delay time modulation for application to communication. We have observed that the robust synchronization is established by a common delay signal and its threshold is presented using Lyapunov…
To respect physics and nature, cellular automata (CA) models of self-organisation, emergence, computation and logical universality should be isotropic, having equivalent dynamics in all directions. We present a novel paradigm, the iso-rule,…
This paper presents a distributed Lyapunov-based control framework for achieving both complete and phase synchronization in a class of leader-follower multi-agent systems composed of identical chaotic agents. The proposed approach…
We study the influence of the dimension of cellular automata (CA) for real time language recognition of one-dimensional languages with parallel input. Specifically, we focus on the question of determining whether every language that can be…
Cellular Automaton (CA) and an Integral Value Transformation (IVT) are two well established mathematical models which evolve in discrete time steps. Theoretically, studies on CA suggest that CA is capable of producing a great variety of…
The properties of two-state nearest-neighbour cellular automata (CA) that are capable of density classification are discussed. It is shown that these CA actually conserve the total density, rather than merely classifying it. This is also…
Each cell of a two-dimensional lattice is painted one of k colors, arranged in a "color wheel." The colors advance (0 to k-1 mod k) either automatically or by contact with at least a threshold number of successor colors in a prescribed…
We present a diagrammatic method to build up sophisticated cellular automata (CAs) as models of complex physical systems. The diagrams complement the mathematical approach to CA modeling, whose details are also presented here, and allow CAs…
An analysis of transition from chaotic to nonchaotic behavior and synchronization in an ensemble of systems driven by identical random forces is presented. The synchronization phenomenon is investigated in the ensemble of particles moving…
While there has been a keen interest in studying computation at the edge of chaos for dynamical systems undergoing a phase transition, this has come under question for cellular automata. We show that for continuously deformed cellular…
A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown that the…
In this paper, a numerical study on the complete synchronization phenomenon exhibited by coupled forced negative conductance circuits is presented. The nonlinear system exhibiting two types of chaotic attractors is studied for complete…
We study the statistical properties of the long-time dynamics of the rule 54 reversible cellular automaton (CA), driven stochastically at its boundaries. This CA can be considered as a discrete-time and deterministic version of the…
Simulating a cellular automaton (CA) for t time-steps into the future requires t^2 serial computation steps or t parallel ones. However, certain CAs based on an Abelian group, such as addition mod 2, are termed ``linear'' because they obey…
We show that a wide class of uncoupled limit cycle oscillators can be in-phase synchronized by common weak additive noise. An expression of the Lyapunov exponent is analytically derived to study the stability of the noise-driven…
In this paper, we study linear cellular automata (CAs) on Cayley tree of order 2 over the field $\mathbb F_p$ (the set of prime numbers modulo $p$). We construct the rule matrix corresponding to finite cellular automata on Cayley tree.…
Stochastic processes govern the time evolution of a huge variety of realistic systems throughout the sciences. A minimal description of noisy many-particle systems within a Markovian picture and with a notion of spatial dimension is given…
We study one-dimensional neighborhood-five conservative cellular automata (CA), referred to as particle cellular automata five (particle CA5). We show that evolution equations for particle CA5s that belong to certain types can be obtained…