Upload resources

Upload your works to SEDICI to increase its visibility and improve its impact

 

Show simple item record

dc.date.accessioned 2012-11-20T14:06:05Z
dc.date.available 2012-11-20T14:06:05Z
dc.date.issued 2006-08
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/24396
dc.description.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 en
dc.language en es
dc.subject Unbounded-action devices (e.g., cellular automata, circuits, networks of machines) es
dc.title Decidable properties for regular cellular automata en
dc.type Objeto de conferencia es
sedici.identifier.isbn 0-387-34633-3 es
sedici.creator.person Di Lena, Pietro es
sedici.description.note 4th IFIP International Conference on Theoretical Computer Science es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Red de Universidades con Carreras en Informática (RedUNCI) es
sedici.subtype Objeto de conferencia es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
sedici.date.exposure 2006-08
sedici.relation.event 19 th IFIP World Computer Congress - WCC 2006 es
sedici.description.peerReview peer-review es


Download Files

Thumbnail
Documento completo
Download file (214.9Kb) - PDF

This item appears in the following Collection(s)

Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) Except where otherwise noted, this item's license is described as Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)