元胞自动机中的严格时间周期点

AUTOMATA & JAC Pub Date : 2012-08-13 DOI:10.4204/EPTCS.90.18
A. Dennunzio, P. Lena, L. Margara
{"title":"元胞自动机中的严格时间周期点","authors":"A. Dennunzio, P. Lena, L. Margara","doi":"10.4204/EPTCS.90.18","DOIUrl":null,"url":null,"abstract":"We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic. This set turns out to be dense for almost equicontinuous surjective cellular automata while it is empty for the positively expansive ones. In the class of additive cellular automata, the set of strictly periodic points can be either dense or empty. The latter happens if and only if the cellular automaton is topologically transitive.","PeriodicalId":415843,"journal":{"name":"AUTOMATA & JAC","volume":"134 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Strictly Temporally Periodic Points in Cellular Automata\",\"authors\":\"A. Dennunzio, P. Lena, L. Margara\",\"doi\":\"10.4204/EPTCS.90.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic. This set turns out to be dense for almost equicontinuous surjective cellular automata while it is empty for the positively expansive ones. In the class of additive cellular automata, the set of strictly periodic points can be either dense or empty. The latter happens if and only if the cellular automaton is topologically transitive.\",\"PeriodicalId\":415843,\"journal\":{\"name\":\"AUTOMATA & JAC\",\"volume\":\"134 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-08-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AUTOMATA & JAC\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.90.18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AUTOMATA & JAC","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.90.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

研究了满射元胞自动机中严格周期点的集合,即对给定自动机具有时间周期但不具有空间周期的组态的集合。对于几乎等连续满射元胞自动机,这个集合是密集的,而对于正膨胀的元胞自动机,这个集合是空的。在加性元胞自动机类中,严格周期点的集合可以是稠密的,也可以是空的。后者发生当且仅当元胞自动机是拓扑可传递的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Strictly Temporally Periodic Points in Cellular Automata
We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic. This set turns out to be dense for almost equicontinuous surjective cellular automata while it is empty for the positively expansive ones. In the class of additive cellular automata, the set of strictly periodic points can be either dense or empty. The latter happens if and only if the cellular automaton is topologically transitive.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Boolean networks synchronism sensitivity and XOR circulant networks convergence time Local Rules for Computable Planar Tilings Fixed Parameter Undecidability for Wang Tilesets Linear functional classes over cellular automata Transductions Computed by One-Dimensional Cellular 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