On von Neumann regularity of cellular automata

IF 1.7 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Natural Computing Pub Date : 2023-01-10 DOI:10.1007/s11047-022-09935-w
Ville Salo
{"title":"On von Neumann regularity of cellular automata","authors":"Ville Salo","doi":"10.1007/s11047-022-09935-w","DOIUrl":null,"url":null,"abstract":"Abstract We show that a cellular automaton on a one-dimensional two-sided mixing subshift of finite type is a von Neumann regular element in the semigroup of cellular automata if and only if it is split epic onto its image in the category of sofic shifts and block maps. It follows from previous joint work of the author and Törmä that von Neumann regularity is a decidable condition, and we decide it for all elementary CA, obtaining the optimal radii for weak generalized inverses. Two sufficient conditions for non-regularity are having a proper sofic image or having a point in the image with no preimage of the same period. We show that the non-regular ECA 9 and 28 cannot be proven non-regular using these methods. We also show that a random cellular automaton is non-regular with high probability.","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2023-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Natural Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11047-022-09935-w","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract We show that a cellular automaton on a one-dimensional two-sided mixing subshift of finite type is a von Neumann regular element in the semigroup of cellular automata if and only if it is split epic onto its image in the category of sofic shifts and block maps. It follows from previous joint work of the author and Törmä that von Neumann regularity is a decidable condition, and we decide it for all elementary CA, obtaining the optimal radii for weak generalized inverses. Two sufficient conditions for non-regularity are having a proper sofic image or having a point in the image with no preimage of the same period. We show that the non-regular ECA 9 and 28 cannot be proven non-regular using these methods. We also show that a random cellular automaton is non-regular with high probability.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
元胞自动机的von Neumann正则性
摘要本文证明了一维有限型双向混合子位移上的元胞自动机是元胞自动机半群中的von Neumann正则元素,当且仅当它在微位移和块映射的范畴内被分割成它的像。从作者和Törmä前人的共同工作中得出von Neumann正则性是一个可判定的条件,并对所有初等CA都判定了它,得到了弱广义逆的最优半径。非正则性的两个充分条件是有一个正确的图像或图像中有一个点没有同时期的预像。我们表明,使用这些方法不能证明非规则ECA 9和28是非规则的。我们还证明了随机元胞自动机具有高概率的非规则性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Natural Computing
Natural Computing Computer Science-Computer Science Applications
CiteScore
4.40
自引率
4.80%
发文量
49
审稿时长
3 months
期刊介绍: The journal is soliciting papers on all aspects of natural computing. Because of the interdisciplinary character of the journal a special effort will be made to solicit survey, review, and tutorial papers which would make research trends in a given subarea more accessible to the broad audience of the journal.
期刊最新文献
Real-time computing and robust memory with deterministic chemical reaction networks Integrated dynamic spiking neural P systems for fault line selection in distribution network Reaction mining for reaction systems Melding Boolean networks and reaction systems under synchronous, asynchronous and most permissive semantics Distinguishing genelet circuit input pulses via a pulse detector
×
引用
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