3 papers
cs.CC2026
Complexity of Fungal Automaton Prediction
Enrico Formenti, Eric Goles, Kévin Perrot +2
Fungal automata are a nature-inspired computational model, where a rule is alternatively applied verticaly and horizontaly. In this work we study the computational complexity of pr…
eess.SY2025
Identification of Cellular Automata on Spaces of Bernoulli Probability Measures
Faizal Hafiz, Amelia Kunze, Enrico Formenti +1
Classical Cellular Automata (CCAs) are a powerful computational framework for modeling global spatio-temporal dynamics with local interactions. While CCAs have been applied across…
nlin.CG2025
Cellular Automata on Probability Measures
Enrico Formenti, Faizal Hafiz, Amelia Kunze +1
Classical Cellular Automata (CCAs) are a powerful computational framework widely used to model complex systems driven by local interactions. Their simplicity lies in the use of a f…