A simulation of cellular automata on hexagons by cellular automata on rings

Theoretical Computer Science

Volumn 263, Issue 1-2, 2001, Pages 231-234

  Martin, Bruno ^a  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

Author keywords

Cayley graphs; Cellular automata; Simulation

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; THEOREM PROVING;

CAYLEY GRAPHS; CELLULAR AUTOMATA;

FINITE AUTOMATA;

EID: 0034917501     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00244-9     Document Type: Article

References (9)

1. Garden of eden configurations for cellular automata on cayley graphs of groups
2. A universal cellular automaton in quasi-linear time and its S-m-n form
3. Embedding torus automata into a ring of automata
4. A linear speed-up theorem for cellular automata
5. One-way cellular automata on Cayley graphs, Proc. FCT'93