Related papers: Reset thresholds of automata with two cycle length…
In this article we consider finite automata networks (ANs) with two kinds of update schedules: the parallel one (all automata are updated all together) and the sequential ones (the automata are updated periodically one at a time according…
We revisit the method of small subgraph conditioning, used to establish that random regular graphs are Hamiltonian a.a.s. We refine this method using new technical machinery for random $d$-regular graphs on $n$ vertices that hold not just…
Let X be a subshift satisfy non-uniform structure. In this paper, we give quantitative estimate of the recurrence sets. These results can be applied to a large class of symbolic systems, including beta-shifts, S-gap shifts and their…
We study probabilistic cellular automata (PCA) and quantum cellular automata (QCA) as frameworks for solving the Maximum Independent Set (MIS) problem. We first introduce a synchronous PCA whose dynamics drives the system toward the…
Common intervals have been defined as a modelisation of gene clusters in genomes represented either as permutations or as sequences. Whereas optimal algorithms for finding common intervals in permutations exist even for an arbitrary number…
The paper is concerned with defining the electrical signals and their models. The delays are discussed, the asynchronous automata - which are the models of the asynchronous circuits - and the examples of the clock generator and of the R-S…
We identify a cyclic property of rotation sequences involving piecewise displacements $\beta$ about arbitrary axes in three dimensions. Specifically, when transformation to the toggling frame is applied successively $m$ times, for…
Two program packages are presented for evaluating one-loop amplitudes. They can work either in dimensional regularization or in constrained differential renormalization. The latter method is found at the one-loop level to be equivalent to…
For families of 4-regular directed circulant graphs with $n$ vertices, we count the number of primitive periodic orbits of length up to at least $n$. The relevant counting techniques are then extended to count the number of primitive pseudo…
We develop a rather elaborate computer program to investigate the jointly periodic points of one-dimensional cellular automata. The experimental results and mathematical context lead to questions, conjectures and a contextual theorem.
Parameter choosing in classical edge detection algorithms can be a costly and complex task. Choosing the correct parameters can improve considerably the resulting edge-map. In this paper we present a version of Edge Drawing algorithm in…
In the computational-mechanics structural analysis of one-dimensional cellular automata the following automata-theoretic analogue of the \emph{change-point problem} from time series analysis arises: \emph{Given a string $\sigma$ and a…
Finite cellular automata (FCA) are widely used in simulating nonlinear complex systems, and their reversibility is closely related to information loss during the evolution. However, only a relatively small portion of their reversibility…
A broad range of nonlinear processes over networks are governed by threshold dynamics. So far, existing mathematical theory characterizing the behavior of such systems has largely been concerned with the case where the thresholds are…
In a recent paper by the same authors, we constructed a stationary 1-dependent 4-coloring of the integers that is invariant under permutations of the colors. This was the first stationary k-dependent q-coloring for any k and q. When the…
We show that there is a one-round randomized distributed algorithm that can 2-color cycles such that the expected fraction of monochromatic edges is less than 0.24118. We also show that a one-round algorithm cannot achieve a fraction less…
In this Letter, we derive a sufficient condition of synchronizing limit sets (attractors and repellers) by using the linear feedback control technique proposed here. There examples are included. The numerical simulations and computer…
The main goal of this article is to introduce new quantitative characteristics of cycles in finite simple connected graphs and to establish relations of these characteristics with the stretch and spanning tree congestion of graphs. The main…
Deterministic one-way time-bounded multi-counter automata are studied with respect to their ability to perform reversible computations, which means that the automata are also backward deterministic and, thus, are able to uniquely step the…
Given positive integers $p$ and $q$, a $(p,q)$-coloring of the complete graph $K_n$ is an edge-coloring in which every $p$-clique receives at least $q$ colors. Erd\H{o}s and Shelah posed the question of determining $f(n,p,q)$, the minimum…