The complexity of the asynchronous prediction for the strict majority automata, 2016. ,
Two state totalistic freezing cellular automata and their complexity Exploratory paper, In: Cellular Automata, 2016. ,
Majority-Vote Cellular Automata, Ising Dynamics, and P-Completeness, Journal of Statistical Physics, vol.88, issue.3/4, pp.795-805, 1977. ,
DOI : 10.1023/B:JOSS.0000015172.31951.7b
Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks, SIAM Journal on Discrete Mathematics, vol.31, issue.3, 2017. ,
DOI : 10.1137/16M1060868
URL : https://hal.archives-ouvertes.fr/hal-01630477
Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory, SIAM Journal on Discrete Mathematics, vol.29, issue.4, pp.2312-2335, 2015. ,
DOI : 10.1137/140988358
URL : https://hal.archives-ouvertes.fr/hal-01298045
First Experiments on the Random Mixtures of Two Elementary Rules, p.97 ,
Pedro Montealegre, and Nicolas Ollinger Distortion in One-Head Machines and Cellular, p.120 ,
Ville Salo Fast One-Way Cellular Automata with Reversible Mealy Cells, p.139 ,
and Alberto Leporati Filling Curves Constructed in Cellular Automata with Aperiodic Tiling, p.165 ,