ON A POLYNOMIAL REPRESENTATION OF FINITE LINEAR CELLULAR AUTOMATA - Collections

＜journal article＞
ON A POLYNOMIAL REPRESENTATION OF FINITE LINEAR CELLULAR AUTOMATA

Creator	Creator Name Nohmi, Masaya 乃美, 正哉 Affiliation Affiliation Name Department of Artificial Intelligence, Kyushu Institute of Technology 九州工業大学知能情報工学科
Language	English
Publisher	Research Association of Statistical Sciences
Publisher	統計科学研究会
Date	1991-03
Source Title	Bulletin of informatics and cybernetics
Vol	24
Issue	3/4
First Page	137
Last Page	145
Publication Type	Version of Record
Access Rights	open access
Crossref DOI	https://doi.org/10.5109/13414
Related DOI	Bulletin of informatics and cybernetics \|\| 24(3/4) \|\| p137-145
Related DOI	http://bic.math.kyushu-u.ac.jp/
Related URI	Bulletin of informatics and cybernetics \|\| 24(3/4) \|\| p137-145
Related URI	http://bic.math.kyushu-u.ac.jp/
Relation	Bulletin of informatics and cybernetics \|\| 24(3/4) \|\| p137-145
Relation	http://bic.math.kyushu-u.ac.jp/
Abstract	This paper decides the behaviour of cellular automata, including the existence of fixed points and the order of configurations, using the polynomial representation of configurations with respect to a ...basis derived from a series of state transition. We are mainly concerned with cellular automata with local transition rule 90 since the method described here can be used for any finite cellular automata with a little alternations [7].show more

File	FileType	Size	Views	Description
p137	pdf	315 KB	325