Decidable properties for regular cellular automata

Autores
Di Lena, Pietro
Año de publicación
2006
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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
4th IFIP International Conference on Theoretical Computer Science
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Unbounded-action devices (e.g., cellular automata, circuits, networks of machines)
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/24396
Acceder
id SEDICI_aca74153d7d7f87739780a2887314d35
oai_identifier_str oai:sedici.unlp.edu.ar:10915/24396
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Decidable properties for regular cellular automataDi Lena, PietroCiencias InformáticasUnbounded-action devices (e.g., cellular automata, circuits, networks of machines)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 automata4th IFIP International Conference on Theoretical Computer ScienceRed de Universidades con Carreras en Informática (RedUNCI)2006-08info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/24396enginfo:eu-repo/semantics/altIdentifier/isbn/0-387-34633-3info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-22T16:37:23Zoai:sedici.unlp.edu.ar:10915/24396Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-22 16:37:23.553SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Decidable properties for regular cellular automata
title Decidable properties for regular cellular automata
spellingShingle Decidable properties for regular cellular automata
Di Lena, Pietro
Ciencias Informáticas
Unbounded-action devices (e.g., cellular automata, circuits, networks of machines)
title_short Decidable properties for regular cellular automata
title_full Decidable properties for regular cellular automata
title_fullStr Decidable properties for regular cellular automata
title_full_unstemmed Decidable properties for regular cellular automata
title_sort Decidable properties for regular cellular automata
dc.creator.none.fl_str_mv Di Lena, Pietro
author Di Lena, Pietro
author_facet Di Lena, Pietro
author_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Unbounded-action devices (e.g., cellular automata, circuits, networks of machines)
topic Ciencias Informáticas
Unbounded-action devices (e.g., cellular automata, circuits, networks of machines)
dc.description.none.fl_txt_mv 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
4th IFIP International Conference on Theoretical Computer Science
Red de Universidades con Carreras en Informática (RedUNCI)
description 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
publishDate 2006
dc.date.none.fl_str_mv 2006-08
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/24396
url http://sedici.unlp.edu.ar/handle/10915/24396
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/isbn/0-387-34633-3
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1846782836535721984
score 12.982451

Publicaciones similares