J. C. Mora

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

We show a CA model of a theoretical population, where predator dynamics evolve through Particle Swarm Optimization. Expand

This paper examines the claim that cellular automata belonging to Class III (in Wolfram’s classification) are capable of (Turing universal) computation. Expand

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

This article finds feasible solutions to the travelling salesman problem, obtaining the route with the shortest distance to visit n cities just once, returning to the starting city. Expand

In cellular automata with memory, the unchanged maps of the conventional cellular automaton are applied to cells endowed with memory of their past states in some specified interval. Expand

The existence of several periodic structures (known as gliders) in the evolution space of the one-dimensional cellular automaton Rule 110, has important lines of investigation in cellular automata theory. Expand