Lempel-Ziv complexity analysis of one dimensional cellular automata
From MaRDI portal
Publication:4591802
DOI10.1063/1.4936876zbMath1374.37020arXiv1511.08657OpenAlexW2176519179WikidataQ87001420 ScholiaQ87001420MaRDI QIDQ4591802
C. A. J. Nunes, E. Estevez-Rams, B. Aragón Fernández, R. Lora-Serrano
Publication date: 17 November 2017
Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.08657
Related Items (4)
Phenomenology of coupled nonlinear oscillators ⋮ Correlation and collective behaviour in Adler-type locally coupled oscillators at the edge of chaos ⋮ Computational capabilities at the edge of chaos for one dimensional systems undergoing continuous transitions ⋮ Information density, structure and entropy in equilibrium and non-equilibrium systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Normalized Lempel-Ziv complexity and its application in bio-sequence analysis
- Lyapunov exponents for one-dimensional cellular automata
- Quantifying complexity in the minority game
- Theory of cellular automata: a survey
- Coding theorems for individual sequences
- Variance estimators for the Lempel-Ziv entropy rate estimator
- The Similarity Metric
- Irreversibility and Heat Generation in the Computing Process
- A sequential algorithm for the universal coding of finite memory sources
- On the Complexity of Finite Sequences
- Elements of Information Theory
- Upper bound on the products of particle interactions in cellular automata
- Kolmogorov complexity and cellular automata classification
This page was built for publication: Lempel-Ziv complexity analysis of one dimensional cellular automata