On beta-skeleton automata with memory
Emerging Technologies
2012-12-14 v1 Formal Languages and Automata Theory
Cellular Automata and Lattice Gases
Abstract
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.
Keywords
Cite
@article{arxiv.1212.2963,
title = {On beta-skeleton automata with memory},
author = {Ramon Alonso-Sanz and Andrew Adamatzky},
journal= {arXiv preprint arXiv:1212.2963},
year = {2012}
}