• Publications
  • Influence
A Note on Elementary Cellular Automata Classification
  • G. Martínez
  • Computer Science, Mathematics
  • J. Cell. Autom.
  • 24 June 2013
TLDR
We overview and compare classifications of elementary cellular automata, including Wolfram's, Wuensche's, Li and Packard, communication complexity, power spectral, topological, surface, compression, lattices, and morphological diversity classifications. Expand
  • 35
  • 4
  • PDF
Approximating Mexican highways with slime mould
TLDR
Plasmodium of Physarum polycephalum is a single cell visible by unaided eye. Expand
  • 62
  • 2
  • PDF
Phenomenology of Reaction-diffusion Binary-State Cellular Automata
TLDR
We study a binary-cell-state eight-cell neighborhood two-dimensional cellular automaton model of a quasi-chemical system with a substrate and a reagent. Expand
  • 32
  • 2
  • PDF
Computation with Competing Patterns in Life-Like Automaton
We study Life-like cellular automaton rule B2/S2345. This automaton exhibits a chaotic behaviour yet capable for purposeful computation. The automaton implements Boolean gates via patterns whichExpand
  • 7
  • 2
Phenomenology of glider collisions in cellular automaton Rule 54 and associated logical gates
TLDR
We study one-dimensional (1D) binary state ternary neighborhood cellular automata exhibiting a sophisticated space–time dynamics of traveling localized patterns, and deal with cell state transition Rule 54, mainly due to its ability to generate rich varieties of periodic structures. Expand
  • 59
  • 1
  • PDF
Computation and Universality: Class IV versus Class III Cellular Automata
TLDR
This paper examines the claim that cellular automata belonging to Class III (in Wolfram’s classification) are capable of (Turing universal) computation. Expand
  • 25
  • 1
  • PDF
Determining a Regular Language by Glider-Based Structures called Phases fi -1 in Rule
TLDR
We propose a representation for coding initial conditions by means of a finite subset of regular expressions specifying a set of phases for each glider in Rule 110. Expand
  • 25
  • 1
  • PDF
On generative morphological diversity of elementary cellular automata
TLDR
The paper builds a hierarchy of generative diversity of one‐dimensional cellular automata with binary cell‐states and ternary neighborhoods, discusses necessary conditions for a cell‐state transition rule to be on top of the hierarchy, and studies stability to initial conditions. Expand
  • 20
  • 1
  • PDF
A Computation in a Cellular Automaton Collider Rule 110
TLDR
A cellular automaton collider is a finite state machine build of rings of one-dimensional cellular automata. Expand
  • 10
  • 1
  • PDF
Complete Characterization of Structure of Rule 54
TLDR
The dynamics of rule 54 one-dimensional two-state cellular automaton are a discrete analog of space-time dynamics of excitations in nonlinear active medium with mutual inhibition. Expand
  • 12
  • 1
  • PDF