Basic properties for sand automata

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We prove several results about the relations between injectivity and surjectivity for sand automata. Moreover, we begin the exploration of the dynamical behavior of sand automata proving that the property of nilpotency is undecidable. We believe that the proof technique used for this last result might reveal useful for many other results in this context.
submitted to STACS 2005

Keywords

Computational Complexity

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32403

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0411007
 http://arxiv.org/abs/cs/0411007

Collections

arXiv