EFFICIENT CHARACTERIZATION OF CELLULAR AUTOMATA

被引：59

作者：

DAS, AK

GANGULY, A

DASGUPTA, A

BHAWMIK, S

CHAUDHURI, PP

机构：

来源：

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES | 1990年 / 137卷 / 01期

关键词：

D O I：

10.1049/ip-e.1990.0008

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The paper characterises cellular automata (CA) with the help of matrix algebra. It has been shown how k-neighborhood additive CA rules (uniform, complemented and hybrid) can be represented with the help of a characteristic matrix representing the CA. Further, the paper discusses how the global group properties of the automata depend on the hybridisation of rules, the length of the automata, the starting state, etc.

引用

页码：81 / 87

页数：7

共 7 条

[1]

[Anonymous], 1966, THEORY SELF REPRODUC

[2]

Gantmacher F., 1959, THEORY MATRICES, VI

[3]

Golomb S. W., 1967, SHIFT REGISTER SEQUE

[4] ALGEBRAIC PROPERTIES OF CELLULAR AUTOMATA [J].

MARTIN, O ;

ODLYZKO, AM ;

WOLFRAM, S .

COMMUNICATIONS IN MATHEMATICAL PHYSICS, 1984, 93 (02) :219-258

[5]

PRIES W, 1986, IEEE T COMPUT, V35, P1013, DOI 10.1109/TC.1986.1676709

[6] STATISTICAL-MECHANICS OF CELLULAR AUTOMATA [J].

WOLFRAM, S .

REVIEWS OF MODERN PHYSICS, 1983, 55 (03) :601-644

[7]

YAP SK, 1987, COVERING SET TEST PA

← 1 →