Abstract
Cellular Automata (CA) are a computational model widely used in many scientific fields. A CA consists of identical finite automata arranged over a regular lattice (i.e. every configuration of a CA is an element of A ℤ where A is a finite set of local states). Each automaton updates its state on the basis of its own state and the one of its neighbors according to a local rule. All updates are synchronous.
This work has been partially supported by the French National Research Agency project EMC (ANR-09-BLAN-0164).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Amar, P., Bernot, G., Norris, V.: Hsim: a simulation programme to study large assemblies of proteins. Journal of Biological Physics and Chemistry 4, 79–84 (2004)
Chandesris, J., Dennunzio, A., Formenti, E., Manzoni, L.: Computational aspects of asynchronous cellular automata (2010), http://arxiv.org/find/all/1/all:+239813/0/1/0/all/0/1
Chopard, B.: Modelling physical systems by cellular automata. In: Rozenberg, G., et al. (ed.) Handbook of Natural Computing: Theory, Experiments, and Applications. Springer, Heidelberg (to appear, 2011)
Lee, J., Adachi, S., Peper, F., Mashiko, S.: Delay-insensitive computation in asynchronous cellular automata. J. Comput. Syst. Sci. 70, 201–220 (2005)
Nakamura, K.: Asynchronous cellular automata and their computational ability. Systems, Computers, Control 5, 58–66 (1974)
Nehaniv, C.L.: Evolution in asynchronous cellular automata. Artificial Life VIII, 65–73 (2002)
Ollinger, N.: Universalities in cellular automata. In: Rozenberg, G., et al. (ed.) Handbook of Natural Computing: Theory, Experiments, and Applications, Springer, Heidelberg (to appear, 2011)
Regnault, D., Schabanel, N., Thierry, E.: Progresses in the analysis of stochastic 2d cellular automata: A study of asynchronous 2d minority. Theoretical Computer Science 410, 4844–4855 (2009)
Schönfisch, B., de Roos, A.: Synchronous and asynchronous updating in cellular automata. BioSystems 51, 123–143 (1999)
Worsch, T.: A note on (intrinsically?) universal asynchronous cellular automata (2010) (preprint)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chandesris, J., Dennunzio, A., Formenti, E., Manzoni, L. (2011). Computational Aspects of Asynchronous Cellular Automata. In: Mauri, G., Leporati, A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22321-1_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-22321-1_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22320-4
Online ISBN: 978-3-642-22321-1
eBook Packages: Computer ScienceComputer Science (R0)