• Publications
  • Influence
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
Modeling Prey-Predator Dynamics via Particle Swarm Optimization and Cellular Automata
TLDR
We show a CA model of a theoretical population, where predator dynamics evolve through Particle Swarm Optimization. Expand
  • 8
  • 2
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
Analyzing the spatial dynamics of a prey–predator lattice model with social behavior
A B S T R A C T A lattice prey–predator model is studied. Transition rules applied sequentially describe processes such as reproduction, predation, and death of predators. The movement of predatorsExpand
  • 7
  • 1
  • PDF
An overview to fault location methods in distribution system based on single end measures of voltage and current
The problem of fault location has been studied deeply for transmission lines due its importance in the power system. Nowadays the problem of fault location on distribution systems is receivingExpand
  • 13
  • 1
  • PDF
Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic.
TLDR
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
  • 4
Complex Dynamics Emerging in Rule 30 with Majority Memory
TLDR
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
  • 35
  • PDF
Gliders in Rule 110
TLDR
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
  • 34
  • PDF