Basic properties for sand automata

Details Basic properties for sand automata Basic properties for sand automata

2004-11-04

arxiv.org/abs/cs/0411007v1

Computer Science

Computational Complexity

submitted to STACS 2005

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Basic properties for sand automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Basic properties for sand automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Basic properties for sand automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-278172