scientific article

zbMath0667.68066MaRDI QIDQ3820012

Kristian Lindgren, Mats G. Nordahl

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

critical exponentsKolmogorov complexityprobability measurecontext-free languagesregular languagesRényi entropieschaotic cellular automatoncomplexity of ensembles of patternsconvergence of block entropiesdimensional cellular automatainformaion complexitystochastic finite automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Cellular automata (computational aspects) (68Q80) Measures of information, entropy (94A17)

Related Items (9)

A measure of statistical complexity based on predictive information with application to finite spin systems ⋮ The approach towards equilibrium in a reversible Ising dynamics model: an information-theoretic analysis based on an exact solution ⋮ Measures of statistical complexity: why? ⋮ The attractor-basin portrait of a cellular automaton ⋮ On the limit set of some universal cellular automata ⋮ Long-range correlations in chaotic cellular automata ⋮ Expressing the entropy of lattice systems as sums of conditional entropies ⋮ Criticality in cellular automata ⋮ A comparative classification of complexity measures

This page was built for publication: