The attractor properties in Cellular Automata dynamical systems have been extensively investigated and well characterized. We consider here two attractor classification for Cellular Au- tomata and we prove the computational undecidability of some questions related to such classifica- tions.
On the Undecidability of Attractor Properties for Cellular Automata / Pietro Di Lena; Luciano Margara. - In: FUNDAMENTA INFORMATICAE. - ISSN 0169-2968. - STAMPA. - 115:1(2012), pp. 75-85. [10.3233/FI-2012-641]
On the Undecidability of Attractor Properties for Cellular Automata
DI LENA, PIETRO;MARGARA, LUCIANO
2012
Abstract
The attractor properties in Cellular Automata dynamical systems have been extensively investigated and well characterized. We consider here two attractor classification for Cellular Au- tomata and we prove the computational undecidability of some questions related to such classifica- tions.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
