Number-conserving cellular automata I: decidability B Durand, E Formenti, Z Róka Theoretical computer science 299 (1-3), 523-535, 2003 | 108 | 2003 |
Cellular automata in the Cantor, Besicovitch, and Weyl topological spaces F Blanchard, E Formenti, P Kurka Complex Systems 11 (2), 107-124, 1997 | 108 | 1997 |
Ergodicity, transitivity, and regularity for linear cellular automata over Zm G Cattaneo, E Formenti, G Manzini, L Margara Theoretical Computer Science 233 (1-2), 147-164, 2000 | 74 | 2000 |
On undecidability of equicontinuity classification for cellular automata B Durand, E Formenti, G Varouchas Discrete Mathematics & Theoretical Computer Science, 2003 | 72 | 2003 |
Non-uniform cellular automata: Classes, dynamics, and decidability A Dennunzio, E Formenti, J Provillard Information and Computation 215, 32-46, 2012 | 66 | 2012 |
Conservation of some dynamical properties for operations on cellular automata L Acerbi, A Dennunzio, E Formenti Theoretical Computer Science 410 (38-40), 3685-3693, 2009 | 61 | 2009 |
On the dynamical behavior of chaotic cellular automata G Cattaneo, E Formenti, L Margara, G Mauri Theoretical Computer Science 217 (1), 31-51, 1999 | 60 | 1999 |
Number conserving cellular automata II: dynamics E Formenti, A Grange Theoretical Computer Science 304 (1-3), 269-290, 2003 | 57 | 2003 |
Multidimensional cellular automata: closing property, quasi-expansivity, and (un) decidability issues A Dennunzio, E Formenti, M Weiss Theoretical Computer Science 516, 40-59, 2014 | 52* | 2014 |
A shift-invariant metric on S zz inducing a non-trivial topology G Cattaneo, E Formenti, L Margara, J Mazoyer Mathematical Foundations of Computer Science 1997: 22nd International …, 1997 | 51 | 1997 |
Fixed points and attractors of reaction systems E Formenti, L Manzoni, AE Porreca Conference on computability in Europe, 194-203, 2014 | 49 | 2014 |
Kolmogorov complexity and cellular automata classification JC Dubacq, B Durand, E Formenti Theoretical Computer Science 259 (1-2), 271-285, 2001 | 48 | 2001 |
On the directional dynamics of additive cellular automata A Dennunzio, P Di Lena, E Formenti, L Margara Theoretical Computer Science 410 (47-49), 4823-4833, 2009 | 45 | 2009 |
Local rule distributions, language complexity and non-uniform cellular automata A Dennunzio, E Formenti, J Provillard Theoretical Computer Science 504, 38-51, 2013 | 44 | 2013 |
Mutually orthogonal latin squares based on cellular automata L Mariot, M Gadouleau, E Formenti, A Leporati Designs, Codes and Cryptography 88 (2), 391-411, 2020 | 40 | 2020 |
m-Asynchronous cellular automata: from fairness to quasi-fairness A Dennunzio, E Formenti, L Manzoni, G Mauri Natural Computing 12, 561-572, 2013 | 38 | 2013 |
Computing issues of asynchronous CA A Dennunzio, E Formenti, L Manzoni Fundamenta Informaticae 120 (2), 165-180, 2012 | 38 | 2012 |
Non-uniform cellular automata G Cattaneo, A Dennunzio, E Formenti, J Provillard Language and Automata Theory and Applications, 302-313, 2009 | 38 | 2009 |
Subshift attractors of cellular automata E Formenti, P Kůrka Nonlinearity 20 (1), 105, 2006 | 38 | 2006 |
On the dynamical behaviour of linear higher-order cellular automata and its decidability A Dennunzio, E Formenti, L Manzoni, L Margara, AE Porreca Information Sciences 486, 73-87, 2019 | 36 | 2019 |