Skip to main content
Conference ProceedingsOPEN ACCESS

Cellular automata preimages: Count and list algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3993 LNCS - III 345-352
DOI: 10.1007/11758532_47
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Preimages of cellular automata are observed. Their number is computed using simple matrix operations. Three algorithms for making a list, of preimages are graphically presented using the de Bruijn diagram and its concatenated form: the preimage network. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Jeras, I., & Dobnikar, A. (2006). Cellular automata preimages: Count and list algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3993 LNCS-III, pp. 345–352). Springer Verlag. https://doi.org/10.1007/11758532_47

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