Related papers: Complexity of Generic Limit Sets of Cellular Autom…
We introduce a new measure on regular languages: their nondeterministic syntactic complexity. It is the least degree of any extension of the `canonical boolean representation' of the syntactic monoid. Equivalently, it is the least number of…
Larger than Life cellular automaton (LtL) is a class of cellular automata and is a generalization of the game of Life by extending its neighborhood radius. We have studied the three-dimensional extension of LtL. In this paper, we show a…
The automatic complexity of a finite word (string) is an analogue for finite automata of Sipser's distinguishing complexity (1983) and was introduced by Shallit and Wang (2001). For a finite alphabet $\Sigma$ of at least two elements, we…
We introduce a new simplicial nerve of higher dimensional automata whose homology groups yield a new definition of the globular homology. With this new definition, the drawbacks noticed with the construction of math.CT/9902151 disappear.…
We conceive finite automata as dynamical systems on discontinuum and investigate their factors. Factors of finite automata include many well-known simple dynamical systems, e.g. hyperbolic systems and systems with finite attractors. In the…
We explore different ways of implementing temporal constraints expressed in an extension of Answer Set Programming (ASP) with language constructs from dynamic logic. Foremost, we investigate how automata can be used for enforcing such…
The term "hybrid system" refers to a continuous time dynamical system that undergoes Markovian perturbations at discrete time intervals. In this paper, we find that under the right formulation, a hybrid system can be treated as a dynamical…
We recall the definition of the $\epsilon$-distortion complexity of a set defined in \cite{bcc} and the results obtained in this paper for Cantor sets of the interval defined by iterated function systems. We state an analogous definition…
We have developed a simple cellular automata model for nonlinearly coupled phase oscillators which can exhibit many important collective dynamical states found in other synchronizing systems. The state of our system is specified by a set of…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
While one-dimensional cellular automata have been well studied, there are relatively few results about multidimensional cellular automata; the investigation of cellular automata defined on Cayley trees constitutes an intermediate class.…
This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial…
A recently introduced cellular automaton model for the description of traffic flow is investigated. It generalises asymmetric exclusion models which have attracted a lot of interest in the past. We calculate the so-called fundamental…
In addition to the $\lambda$ parameter, we have found another parameter which characterize the class III, class II and class IV patterns more quantitatively. It explains why the different classes of patterns coexist at the same $\lambda$.…
Cellular automata are dynamical systems defined on lattices and commuting with the Bernoulli shift. In this work, we focus on the spectral properties of D-dimensional cellular automata. We give a characterization of their spectrum from both…
We define the notion of stochastic stability, already present in the literature in the context of smooth dynamical systems, for invariant measures of cellular automata perturbed by a random noise, and the notion of strongly stochastically…
We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length $\varTheta(n^2)$, where…
Can we quantify the change of complexity throughout evolutionary processes? We attempt to address this question through an empirical approach. In very general terms, we simulate two simple organisms on a computer that compete over limited…
This paper deals with descriptive complexity of picture languages of any dimension by syntactical fragments of existential second-order logic. - We uniformly generalize to any dimension the characterization by Giammarresi et al.…
This article surveys some theoretical aspects of Cellular Automata (CAs) research. In particular, we discuss on maximal length CA. An n-cell CA is a maximal length CA, if all the configurations except one form a single cycle. There is a…