Titlebook: Cellular Automata and Discrete Complex Systems; 23rd IFIP WG 1.5 Int Alberto Dennunzio,Enrico Formenti,Antonio E. Porre Conference proceedi

有抱负者

Restricted Binary Strings and Generalized Fibonacci Numbers 0’s and the set of length . strings avoiding . consecutive 0’s and 1’s with some more restriction on the first and last letter, via a simple bijection. In the special case . a probably new interpretation of Fibonacci numbers is given..Moreover, we describe in a combinatorial way the relation betwee

ENACT

Von Neumann Regular Cellular Automatafunction. Let . be the monoid of all CA over .. In this paper, we investigate a generalisation of the inverse of a CA from the semigroup-theoretic perspective. An element . is . (or simply .) if there exists . such that . and ., where . is the composition of functions. Such an element . is called a

婴儿

蜡烛

Semblance

Equicontinuity and Sensitivity of Nondeterministic Cellular Automata equicontinuity and sensitivity to multivalued functions and investigate the characteristics of equicontinuous, almost equicontinuous and sensitive NCA. The dynamical behavior of nondeterministic CA in these classes is much less constrained than in the deterministic setting. In particular, we show t

Infect

Diploid Cellular Automata: First Experiments on the Random Mixtures of Two Elementary Rulesutomata. We use numerical simulations to study the mixtures obtained with three blind rules: the null rule, the identity rule and the inversion rule. As the mathematical analysis of such systems is a difficult task, we use numerical simulations to get insights into the dynamics of this class of stoc

OTTER

PANT

Distortion in One-Head Machines and Cellular Automatailies comes from one-head machines, and allows us to build such automorphisms for the full shift, and to obtain undecidability results. We also give some conditions on the functions that can occur as such growths.

Intrepid

Fast One-Way Cellular Automata with Reversible Mealy Cellsme one-way cellular automata (.) are considered which are composed of reversible Mealy automata. Moreover, we differentiate between three notions of reversibility in the Mealy automata, namely, between weak and strong reversibility as well as reversible partitioned . which have been introduced by Mo

HEW

Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automataady been settled for bipermutive CA with linear local rules, we address the general case of nonlinear rules, which could be interesting for cryptographic applications such as the design of cheater-immune secret sharing schemes. We first prove that two bipermutive CA generating orthogonal Latin squar