Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

MFCS
2005
Springer

favoriteEmaildiscussreport

111views Theoretical Computer Science» more MFCS 2005»

Basic Properties for Sand Automata

13 years 10 months ago

Basic Properties for Sand Automata

Download www.irisa.fr

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 ultimate periodicity is undecidable. We believe that the proof technique used for this last result might turn out to be useful for many other results in the same context.

Julien Cervelle, Enrico Formenti, Benoît Mas

Real-time Traffic

MFCS 2005 | Sand Automata | Ultimate Periodicity | We Believe |

claim paper

Related Content

» Topological properties of sand automata as cellular automata

» Composing Semialgebraic OMinimal Automata

» A Parallel Programming Style and Its Algebra of Programs

» Timed IO Automata A Mathematical Framework for Modeling and Analyzing RealTime Systems

» Neuropercolation A Random Cellular Automata Approach to Spatiotemporal Neurodynamics

» A Calculus of Gamma Programs

» Event Count Automata A StateBased Model for Stream Processing Systems

» Generation of Constants and Synchronization of Finite Automata

» ModeAutomata About Modes and States for Reactive Systems

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	MFCS
Authors	Julien Cervelle, Enrico Formenti, Benoît Masson

Comments (0)