activity
20072021
most citedHow to make dull cellular automata complex by adding memory: Rule 126 case study

28 citations · 95 across the 10 of their papers we have counts for

collaborators
Showing nlin.CGShow all

9 papers · 1 filter

nlin.CG2020

Random Expansion Method for the Generation of Complex Cellular Automata

Juan Carlos Seck-Tuoh-Mora, Norberto Hernandez-Romero, Joselito Medina-Marin +2

The emergence of complex behaviors in cellular automata is an area that has been widely developed in recent years with the intention to generate and analyze automata that produce s…

nlin.CG2020

On complex dynamics from reversible cellular automata

Juan Carlos Seck-Tuoh-Mora, Genaro J. Martinez, Norberto Hernandez-Romero +2

Complexity has been a recurrent research topic in cellular automata because they represent systems where complex behaviors emerge from simple local interactions. A significant amou…

nlin.CG2018★ 7 cited

Simple networks on complex cellular automata: From de Bruijn diagrams to jump-graphs

Genaro J. Martínez, Andrew Adamatzky, Bo Chen +2

We overview networks which characterise dynamics in cellular automata. These networks are derived from one-dimensional cellular automaton rules and global states of the automaton e…

nlin.CG2014★ 2 cited

Logic gates and complex dynamics in a hexagonal cellular automaton: the Spiral rule

Rogelio Basurto, Paulina A. León, Genaro J. Martínez +1

In previous works, hexagonal cellular automata (CA) have been studied as a variation of the famous Game of Life CA, mainly for spiral phenomena simulations; where the most interest…

nlin.CG2013★ 23 cited

Computation and Universality: Class IV versus Class III Cellular Automata

Genaro J. Martinez, Juan C. Seck-Tuoh-Mora, Hector Zenil

This paper examines the claim that cellular automata (CA) belonging to Class III (in Wolfram's classification) are capable of (Turing universal) computation. We explore some chaoti…

nlin.CG2012★ 28 cited

How to make dull cellular automata complex by adding memory: Rule 126 case study

Genaro J. Martinez, Andrew Adamatzky, Juan C. Seck-Tuoh-Mora +1

Using Rule 126 elementary cellular automaton (ECA) we demonstrate that a chaotic discrete system --- when enriched with memory -- hence exhibits complex dynamics where such space e…

nlin.CG2012

Wolfram's Classification and Computation in Cellular Automata Classes III and IV

Genaro J. Martinez, J. C. Seck-Tuoh-Mora, Hector Zenil

We conduct a brief survey on Wolfram's classification, in particular related to the computing capabilities of Cellular Automata (CA) in Wolfram's classes III and IV. We formulate a…

nlin.CG2009★ 13 cited

Complex dynamics emerging in Rule 30 with majority memory

Genaro J. Martinez, Andrew Adamatzky, Ramon Alonso-Sanz +1

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

nlin.CG2007★ 21 cited

Determining a regular language by glider-based structures called phases fi_1 in Rule 110

Genaro Juarez Martinez, Harold V. McIntosh, Juan C. Seck Tuoh Mora +1

Rule 110 is a complex elementary cellular automaton able of supporting universal computation and complicated collision-based reactions between gliders. We propose a representation…