On beta-skeleton automata with memory
  A \beta-skeleton is a proximity undirected graph whose connectivity is determined by the parameter \beta. We study \beta-skeleton automata where every node is a finite state machine taking two states, and updating its states depending on the states of adjacent automata-nodes. We allow automata-nodes to remember their previous states. In computational experiments we study how memory affects the global space-time dynamics on \beta-skeleton automata. 
Ramon Alonso-Sanz and Andrew Adamatzky
cs.ET cs.FL nlin.CG