Non uniform cellular automata description of signed partition versions of ice and sand pile models

10Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper reviews the well-known formalisations for ice and sand piles, based on a finite sequence of non-negative integers and its recent extension to signed partitions, i.e. sequences of a non-negative and a non-positive part of integers, both non increasing. The ice pile model can be interpreted as a discrete time dynamical system under the action of a vertical and a horizontal evolution rule, whereas the sand pile model is characterized by the unique action of the vertical rule. The signed partition extension, besides these two dynamical evolution rules, also takes into account an annihilation rule at the boundary region between the non-negative and the non-positive regions. We provide an original physical interpretation of this model as a p-n junction of two semiconductors. Moreover, we show how the sand pile extension of the signed partition environment can be formalized by mean of a non-uniform cellular automaton (CA) since the vertical and the annihilation evolution rules have the formal description of two CA local rules. Finally, we provide a similar construction for the ice pile extension.

Cite

CITATION STYLE

APA

Cattaneo, G., Chiaselotti, G., Dennunzio, A., Formenti, E., & Manzoni, L. (2014). Non uniform cellular automata description of signed partition versions of ice and sand pile models. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8751, 115–124. https://doi.org/10.1007/978-3-319-11520-7_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free