We investigate decidable properties for regular cellular automata. In particular, we show that regularity itself is an undecidable property and that nilpotency, equicontinuity and positively expansiveness became decidable if we restrict to regular cellular automata.
Titolo: | Decidable Properties for Regular Cellular AutomataFourth IFIP International Conference on Theoretical Computer Science- TCS 2006 | |
Autore/i: | DI LENA, PIETRO | |
Autore/i Unibo: | ||
Anno: | 2006 | |
Titolo del libro: | IFIP International Federation for Information ProcessingFourth IFIP International Conference on Theoretical Computer Science- TCS 2006 | |
Pagina iniziale: | 185 | |
Pagina finale: | 196 | |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1007/978-0-387-34735-6_17 | |
Abstract: | We investigate decidable properties for regular cellular automata. In particular, we show that regularity itself is an undecidable property and that nilpotency, equicontinuity and positively expansiveness became decidable if we restrict to regular cellular automata. | |
Data prodotto definitivo in UGOV: | 28-giu-2013 | |
Appare nelle tipologie: | 4.01 Contributo in Atti di convegno |
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.