当前位置: X-MOL 学术J. Comput. Syst. Sci. › 论文详情
Complete simulation of automata networks
Journal of Computer and System Sciences ( IF 1.129 ) Pub Date : 2019-12-06 , DOI: 10.1016/j.jcss.2019.12.001
Florian Bridoux; Alonso Castillo-Ramirez; Maximilien Gadouleau

Consider a finite set A and n≥1. We study complete simulation of transformations of An, also known as automata networks. For m≥n, a transformation of Am is n-complete of size m if it may simulate every transformation of An by updating one register at a time. Using tools from memoryless computation, we establish that there is no n-complete transformation of size n, but there is one of size n+1. By studying various constructions, we conjecture that the maximal time of simulation of any n-complete transformation is at least 2n. We also investigate the time and size of sequentially n-complete transformations, which may simulate every finite sequence of transformations of An. Finally, we show that there is no n-complete transformation updating all registers in parallel, but there exists one updating all but one register in parallel. This illustrates the strengths and weaknesses of sequential and parallel models of computation.
更新日期:2020-01-04

 

全部期刊列表>>
Springer Nature 2019高下载量文章和章节
化学/材料学中国作者研究精选
《科学报告》最新环境科学研究
ACS材料视界
自然科研论文编辑服务
中南大学国家杰青杨华明
剑桥大学-
中南大学
材料化学和生物传感方向博士后招聘
课题组网站
X-MOL
北京大学分子工程苏南研究院
华东师范大学分子机器及功能材料
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug