1990
DOI: 10.1049/ip-e.1990.0008
|View full text |Cite
|
Sign up to set email alerts
|

Efficient characterisation of cellular automata

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
30
0
2

Year Published

1998
1998
2021
2021

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 41 publications
(32 citation statements)
references
References 5 publications
0
30
0
2
Order By: Relevance
“…[3] A noncomplemented CA is a group CA if and only if T m = I where T is the characteristic matrix of the CA, I is the identity matrix and m is a positive integer.…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…[3] A noncomplemented CA is a group CA if and only if T m = I where T is the characteristic matrix of the CA, I is the identity matrix and m is a positive integer.…”
Section: Preliminariesmentioning
confidence: 99%
“…And researchers have studied on cellular automata configured with rules 51, 60, 102, 153, 195 or 204 [1][2][3][4][5][6][7].…”
Section: Introductionmentioning
confidence: 99%
“…The concept of programmable CA has been introduced in [12]. A scheme for generation and decoding of bit error correcting codes, using CA has been proposed [13].…”
Section: Vlsi Applicationsmentioning
confidence: 99%
“…Later Das [4] extended the characterization of one dimensional CA with the help of Matrix Algebra. Many applications of one dimensional CA [9][10][11][12][13][14][15][16][17] have been reported. On the other hand, 2D CA is not yet a well studied area.…”
Section: Introductionmentioning
confidence: 99%
“…And researchers have studied on cellular automata configured with rules 51, 60, 102, 153, 195 or 204 [1][2][3][4][5][6][7][8].…”
Section: Introductionmentioning
confidence: 99%