The Computation for Reversibility of Arbitrary One-dimensional Finite Cellular Automata Becomes Efficient

Chen Wang, Junchi Ma, Chao Wang, Defu Lin, Weilin Chen
{"title":"The Computation for Reversibility of Arbitrary One-dimensional Finite Cellular Automata Becomes Efficient","authors":"Chen Wang, Junchi Ma, Chao Wang, Defu Lin, Weilin Chen","doi":"arxiv-2402.05404","DOIUrl":null,"url":null,"abstract":"In this paper, we completely solve the reversibility of one-dimensional\nfinite cellular automata (FCA). This means that we will have an efficient\nmethod to determine the reversibility of any FCA with all numbers (n) of cells.\nThe complexity of this algorithm is independent of n. We perform calculations\non two new kinds of graphs and discover that the reversibility of any FCA\nexhibits periodicity as n increases. We successfully provide a method to\ncompute the reversibility sequence that encompasses the reversibility of FCA\nwith any number of cells. Additionally, the calculations in this paper are\napplicable to FCA with various types of boundaries.","PeriodicalId":501231,"journal":{"name":"arXiv - PHYS - Cellular Automata and Lattice Gases","volume":"108 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - PHYS - Cellular Automata and Lattice Gases","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2402.05404","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we completely solve the reversibility of one-dimensional finite cellular automata (FCA). This means that we will have an efficient method to determine the reversibility of any FCA with all numbers (n) of cells. The complexity of this algorithm is independent of n. We perform calculations on two new kinds of graphs and discover that the reversibility of any FCA exhibits periodicity as n increases. We successfully provide a method to compute the reversibility sequence that encompasses the reversibility of FCA with any number of cells. Additionally, the calculations in this paper are applicable to FCA with various types of boundaries.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
任意一维有限蜂窝自动机的可逆性计算变得高效
在本文中,我们完全解决了一维无限蜂窝自动机(FCA)的可逆性问题。这意味着我们将有一种有效的方法来确定任何具有所有单元数(n)的 FCA 的可逆性。我们在两种新图形上进行了计算,发现任何 FCA 的可逆性都会随着 n 的增加而呈现周期性。我们成功地提供了一种计算可逆性序列的方法,该序列包含任何单元数的 FCA 的可逆性。此外,本文的计算还适用于具有各种边界的 FCA。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Networks of Binary Necklaces Induced by Elementary Cellular Automata Rules Convolutional Neural Networks for Automated Cellular Automaton Classification Efficient Simulation of Non-uniform Cellular Automata with a Convolutional Neural Network Block approximations for probabilistic mixtures of elementary cellular automata Complete ergodicity in one-dimensional reversible cellar automata
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1