Randomness on full shift spaces

DOI10.1016/S0960-0779(99)00206-4zbMath1064.68064OpenAlexW2053672429WikidataQ57001727 ScholiaQ57001727MaRDI QIDQ1868530

Peter H. Hertling, Cristian S. Calude, Helmut Jürgensen, Weihrauch, Klaus

Publication date: 28 April 2003

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0960-0779(99)00206-4

zbMATH Keywords

surjective cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Cites Work

• On normal numbers
• Computation theoretic aspects of cellular automata
• Invertible cellular automata: A review
• Injectivity and surjectivity of parallel maps for cellular automata
• Tesselations with local transformations
• A Theory of Program Size Formally Identical to Information Theory
• Condition for injectivity of global maps for tessellation automata
• Algorithmic complexity of points in dynamical systems
• An Introduction to Symbolic Dynamics and Coding
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• On the Length of Programs for Computing Finite Binary Sequences
• The definition of random sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Randomness on full shift spaces