Set-Theoretic Reconstructability of Elementary Cellular Automata

Authors

Martin Zwick, Portland State UniversityFollow
Hui Shu, Portland State University

Document Type

Post-Print

Publication Date

1995

Subjects

System design, System analysis, Log-linear models, Data structures

Abstract

Set-theoretic reconstructability analysis is used to characterize the structures of the mappings of elementary cellular automata. The minimum complexity structure for each ECA mapping, indexed by parameter σ, is more effective than the λ parameter of Langton as a predictor of chaotic dynamics.

Description

This is the author's manuscript copy of an article originally published in Advances in Systems Science and Applications, 1, pp. 31-36.

Persistent Identifier

http://archives.pdx.edu/ds/psu/18886

Citation Details

Zwick, Martin and Shu, Hui, "Set-Theoretic Reconstructability of Elementary Cellular Automata" (1995). Systems Science Faculty Publications and Presentations. 99.
http://archives.pdx.edu/ds/psu/18886