Basic properties for sand automata

Simple item page
dc.creatorCervelle, Julien
dc.creatorFormenti, Enrico
dc.creatorMasson, Benoit
dc.date2004-11-04
dc.date.accessioned2026-07-07T03:21:56Z
dc.date.available2026-07-07T03:21:56Z
dc.descriptionWe 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.
dc.descriptionsubmitted to STACS 2005
dc.identifierhttps://arxiv.org/abs/cs/0411007
dc.identifierhttp://arxiv.org/abs/cs/0411007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32403
dc.subjectComputational Complexity
dc.titleBasic properties for sand automata
dc.typetext

Files

Collections

arXiv