Amenable groups and cellular automata

被引：52

作者：

Ceccherini-Silberstein, TG

Machì, A

Scarabotti, F

机构：

[1] Univ Sannio, Fac Ingn, I-82100 Corso Garibaldi, Benevento, Italy

[2] Univ Rome La Sapienza, Dipartimento Matemat G Castelnuovo, I-00185 Rome, Italy

[3] Univ Rome La Sapienza, Dipartimento Metodi & Modelli Matematici, I-00185 Rome, Italy

来源：

ANNALES DE L INSTITUT FOURIER | 1999年 / 49卷 / 02期

关键词：

amenable group; Cayley graph; cellular automaton; Garden of Eden;

D O I：

10.5802/aif.1686

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We show that the theorems of Moors and Myhill hold for cellular automata whose universes are Cayley graphs of amenable finitely generated groups. This extends the analogous result of A. Machi and F. Mignosi "Garden of Eden configurations for cellular automata on Cayley graphs of groups" for groups of sub-exponential growth.

引用

页码：673 / +

页数：14

共 15 条

[1]

ADYAN SI, 1983, MATH USSR IZV, V21, P425, DOI 10.1070/IM1983v021n03ABEH001799

[2] SOME CLARIFICATIONS OF CONCEPT OF A GARDEN-OF-EDEN CONFIGURATION [J].

AMOROSO, S ;

COOPER, G ;

PATT, Y .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1975, 10 (01) :77-82

[3]

[Anonymous], 1966, THEORY SELF REPRODUC

[4]

BERLEKAMP ER, 1982, WINNING WAYS YOUR MA, V2, pCH25

[5]

Ceccherini-Silberstein TG, 1997, ENSEIGN MATH, V43, P337

[6]

CECCHERINISILBE.T, IN RPESS AMENABILITY

[7]

FURSTENBERG H, COMMUNICATION

[8]

Greenleaf F., 1969, NOSTRAND MATH STUD S, V16

[9]

Grigorchuk R. I., 1984, MATH USSR IZV, V48, P939, DOI 10.1070/IM1985v025n02ABEH001281

[10]

GROMOV M, 1998, IHESM9856

← 1 2 →