当前位置: X-MOL 学术J. Comput. Syst. Sci. › 论文详情
Complete simulation of automata networks
Journal of Computer and System Sciences ( IF 1.494 ) 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

 

全部期刊列表>>
胸部和胸部成像专题
自然科研论文编辑服务
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
鲁照永
华东师范大学
苏州大学
南京工业大学
南开大学
中科大
唐勇
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
中洪博元
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
广东实验室
南京大学
王杰
南科大
刘尊峰
湖南大学
清华大学
王小野
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug