This paper discusses a special technique, called conditionally matching rules (CMRs), for
the representation of transition functions of cellular automata (CA) and its application to the …

The paper deals with the design of uniform multi-state one-dimensional cellular automata
using an evolutionary algorithm and their application to solve the problem of generic square …

A comparative study is presented regarding the evolutionary design of complex multi-state
cellular automata. In particular, two-dimensional cellular automata will be considered in …

This paper presents evolutionary design of two-dimensional, uniform cellular automata. The
problem of replicating loops is considered as a case study. Conditionally matching rules are …

In this study we present some advanced experiments dealing with the evolutionary design of
multi-state uniform cellular automata. The generic square calculation problem in one …

In this study we present some advanced experiments dealing with the evolutionary design of
multi-state uniform cellular automata. The generic square calculation problem in one …

Replicating loops represent a class of benchmarks, which is commonly studied in relation
with cellular automata. Most of the known loops, for which replication rules exist in two …