The easiest form of designing Cellular Automata rules with features such as invertibility or particle conserving is to rely on a partitioning scheme, the most important of which is the 2D Margolus neighborhood. In this paper we introduce a ID Margolus-like neighborhood that gives support to a complete set of Cellular Automata models. We present a set of models called Sliding Ball Models based on this neighborhood and capable of universal computation. We show the way of designing logic gates with these models, propose a digital structure to implement them and finally we present SBMTool, a software development system capable of working with the new models. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Cerdá, J., Gadea, R., Martínez, J. D., & Sebastiá, A. (2005). A tool for implementing and exploring SBM models: Universal 1D invertible cellular automata. In Lecture Notes in Computer Science (Vol. 3561, pp. 279–289). Springer Verlag. https://doi.org/10.1007/11499220_29
Mendeley helps you to discover research relevant for your work.