中文版 | English
Title

An algorithm of finding rules for a class of cellular automata

Author
Corresponding AuthorZhang, Fangfang
Publication Years
2023
DOI
Source Title
ISSN
1758-0366
EISSN
1758-0374
Volume21Issue:4
Abstract
A cellular automata (CA) is an important modelling paradigm for complex systems. In the design of CA, the most difficult task is to find the transformation rules that describe the temporal evolution or pattern of a modelled system. A CA with weights (CAW) yields transition rules algorithm is proposed in this paper, which has ample physical meanings and extend the category of CA. Firstly, the weights are increased to connect the updated cell and its neighbours, and the output of each cell depends on the states of cells in the neighbourhood and their respective weights. Secondly, the error correction algorithm is adopted to find correct transition rules by adjusting weights. When the error is zero, the required transition rules with correct weights will be found to describe the fixed configuration. The CAW with the correct rules will relax to the fixed configuration regardless of the initial states. Finally, the mathematical analysis and simulation are carried out with one-dimensional CAW, and the results show that the proposed algorithm has the ability to find correct transition rules as the error converges exponentially.
Keywords
URL[Source Record]
Indexed By
Language
English
SUSTech Authorship
Others
Funding Project
industry-university-research collaborative innovation fund project of Qilu University of Technology (Shandong Academy of Sciences)["2021CXY-13","2021CXY-14"] ; Youth Innovation Science and technology support plan of colleges in Shandong Province[2021KJ025] ; Studio Project of the Research Leader in Jinan City[2019GXRC062] ; Basic research (free exploration) project of Shenzhen Science and Innovation Commission[201803023000889] ; major scientific and technological innovation projects of Shandong Province["2019JZZY010731","2020CXGC010901"]
WOS Research Area
Computer Science
WOS Subject
Computer Science, Artificial Intelligence ; Computer Science, Theory & Methods
WOS Accession No
WOS:001045502300002
Publisher
Data Source
Web of Science
Citation statistics
Cited Times [WOS]:1
Document TypeJournal Article
Identifierhttp://kc.sustech.edu.cn/handle/2SGJ60CL/583034
DepartmentDepartment of Mechanical and Energy Engineering
Affiliation
1.Qilu Univ Technol, Inst Oceanog Instrumentat, Shandong Acad Sci, Qingdao, Peoples R China
2.Qilu Univ Technol, Shandong Acad Sci, Sch Informat & Automat Engn, Jinan, Peoples R China
3.Southern Univ Sci & Technol, Dept Mech & Energy Engn, Shenzhen, Peoples R China
4.Changchun Inst Technol, Sch Comp Technol & Engn, Changchun, Peoples R China
5.Qilu Univ Technol, Inst Oceanog Instrumentat, Shandong Acad Sci, Qingdao, Peoples R China
Recommended Citation
GB/T 7714
Kou, Lei,Zhang, Fangfang,Chen, Luobing,et al. An algorithm of finding rules for a class of cellular automata[J]. INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION,2023,21(4).
APA
Kou, Lei.,Zhang, Fangfang.,Chen, Luobing.,Ke, Wende.,Yuan, Quande.,...&Wang, Zhen.(2023).An algorithm of finding rules for a class of cellular automata.INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION,21(4).
MLA
Kou, Lei,et al."An algorithm of finding rules for a class of cellular automata".INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION 21.4(2023).
Files in This Item:
There are no files associated with this item.
Related Services
Fulltext link
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Export to Excel
Export to Csv
Altmetrics Score
Google Scholar
Similar articles in Google Scholar
[Kou, Lei]'s Articles
[Zhang, Fangfang]'s Articles
[Chen, Luobing]'s Articles
Baidu Scholar
Similar articles in Baidu Scholar
[Kou, Lei]'s Articles
[Zhang, Fangfang]'s Articles
[Chen, Luobing]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Kou, Lei]'s Articles
[Zhang, Fangfang]'s Articles
[Chen, Luobing]'s Articles
Terms of Use
No data!
Social Bookmark/Share
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.