An Example of Computation of the Density of Ones in Probabilistic Cellular Automata by Direct Recursion

DOI10.1007/978-3-319-65558-1_10zbMath1402.68128arXiv1506.06655OpenAlexW853868720MaRDI QIDQ4558938

Henryk Fukś

Publication date: 30 November 2018

Published in: Emergence, Complexity and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.06655

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the measure attractor of a cellular automaton
• Difference Equations
• Conservation laws in cellular automata
• Construction of local structure maps for cellular automata
• Limit sets of cellular automata associated to probability measures

This page was built for publication: An Example of Computation of the Density of Ones in Probabilistic Cellular Automata by Direct Recursion