相关论文: Finding The Sign Of A Function Value By Binary Cel…

This paper presents a classification of Cellular Automata rules based on its properties at the nth iteration. Elaborate computer program has been designed to get the nth iteration for arbitrary 1-D or 2-D CA rules. Studies indicate that the…

The Thue-Morse sequence (1, -1, -1, 1, -1, 1, 1, ...) can in a sense be naturally extended to a continuous function f called the Fabius function. It is shown how to determine the exact value of f(x) whenever x is the ratio between a…

We show that cellular automata can classify data by inducing a form of dynamical phase coexistence. We use Monte Carlo methods to search for general two-dimensional deterministic automata that classify images on the basis of activity, the…

We consider random boolean cellular automata on the integer lattice, i.e., the cells are identified with the integers from 1 to $N$. The behaviour of the automaton is mainly determined by the support of the random variable that selects one…

We study the dynamics of (synchronous) one-dimensional cellular automata with cyclical boundary conditions that evolve according to the majority rule with radius $ r $. We introduce a notion that we term cell stability with which we express…

We study the fixed points of outer-totalistic cellular automata on sparse random regular graphs. These can be seen as constraint satisfaction problems, where each variable must adhere to the same local constraint, which depends solely on…

A new fast (real time) sorter of binary numbers by one-dimensional cellular automata is proposed. It sorts a list of n numbers represented by k-bits each in exactly nk steps. This is only one step more than a lower bound.

In this paper, linear Cellular Automta (CA) rules are recursively generated using a binary tree rooted at "0". Some mathematical results on linear as well as non-linear CA rules are derived. Integers associated with linear CA rules are…

The 'nice' $x:\mathbf{R}\rightarrow\{0,1\}^{n}$ functions from the asynchronous systems theory are called signals. The periodicity of a point of the orbit of the signal x is defined and we give a note on the existence of the prime period.

It is obtained necessary and sufficient conditions of dependence on $\aleph$ coordinates for functions of several variables, each of which is a product of metrizable factors. The set of discontinuity points of such functions is…

We give a one-sentence proof that a continuous real-valued function f on a closed, bounded interval attains a maximum value, by the following device. We define x in [a, b] to be a lookout point if f(t) does not exceed f(x) whenever t lies…

Let A be a set of integers and let h \geq 2. For every integer n, let r_{A, h}(n) denote the number of representations of n in the form n=a_1+...+a_h, where a_1,...,a_h belong to the set A, and a_1\leq ... \leq a_h. The function r_{A,h}…

Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the…

We describe in the space of binary forms of degree d the strata of forms having constant rank. We also give a simple algorithm to determine the rank of a given form.

For many cellular automata, it is possible to express the state of a given cell after $n$ iterations as an explicit function of the initial configuration. We say that for such rules the solution of the initial value problem can be obtained.…

We prove an analogue of Hilbert's Tenth Problem for complex meromorphic functions. More precisely, we prove that the set of integers is positive existentially definable in fields of complex meromorphic functions in several variables over…

We show that if $f$ is an integer-valued function with spectral norm at most $M$ then there are subspaces $V_1,\dots,V_L$ and signs $\sigma_1,\dots,\sigma_L \in \{-1,1\}$ such that $f=\sigma_1 1_{V_1} + \dots + \sigma_L 1_{V_L}$ where $L <…

Semi-bent Boolean functions are interesting from a cryptographic standpoint, since they possess several desirable properties such as having a low and flat Walsh spectrum, which is useful to resist linear cryptanalysis. In this paper, we…

We introduce a method to estimate the complexity function of symbolic dynamical systems from a finite sequence of symbols. We test such complexity estimator on several symbolic dynamical systems whose complexity functions are known exactly.…

We consider the problem of finding the density of 1's in a configuration obtained by $n$ iterations of a given cellular automaton (CA) rule, starting from disordered initial condition. While this problems is intractable in full generality…