Non-maximal sensitivity to synchronism in periodic elementary cellular automata: exact asymptotic measures
暂无分享,去创建一个
[1] Kévin Perrot,et al. Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates , 2018 .
[2] Eric Goles Ch.,et al. On the robustness of update schedules in Boolean networks , 2009, Biosyst..
[3] Giancarlo Mauri,et al. Transformations of the One-Dimensional Cellular Automata Rule Space , 1997, Parallel Comput..
[4] Eric Goles Ch.,et al. Block Invariance in Elementary Cellular Automata , 2015, Journal of Cellular Automata.
[5] Nazim Fatès,et al. A Guided Tour of Asynchronous Cellular Automata , 2013, J. Cell. Autom..
[6] Kévin Perrot,et al. Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations , 2020, Inf. Comput..
[7] Eric Goles Ch.,et al. Block Invariance in a Family of Elementary Cellular Automata , 2018, J. Cell. Autom..
[8] Matthew Cook,et al. Universality in Elementary Cellular Automata , 2004, Complex Syst..
[9] Sylvain Sené,et al. About block-parallel Boolean networks: a position paper , 2020, Natural Computing.
[10] Kévin Perrot,et al. Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations , 2019, Natural Computing.
[11] Julio Aracena,et al. Combinatorics on update digraphs in Boolean networks , 2011, Discret. Appl. Math..