Universal pattern generation by cellular automata

DOI10.1016/j.tcs.2011.12.037zbMath1238.68089DBLPjournals/tcs/Kari12OpenAlexW2012865882WikidataQ62045922 ScholiaQ62045922MaRDI QIDQ418784

Jarkko Kari

Publication date: 30 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.037

zbMATH Keywords

cellular automataCollatz problempattern generationuniversal constructor

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (8)

One-dimensional pattern generation by cellular automata ⋮ On computing the Lyapunov exponents of reversible cellular automata ⋮ Transitive action on finite points of a full shift and a finitary Ryan’s theorem ⋮ On the trace subshifts of fractional multiplication automata ⋮ One-dimensional pattern generation by cellular automata ⋮ Cellular automata and powers of p∕q ⋮ A one-dimensional physically universal cellular automaton ⋮ Pre-expansivity in cellular automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamical properties of expansive one-sided cellular automata
• Theory of cellular automata: a survey
• ×2 and ×3 invariant measures and entropy
• The 3x + 1 Problem and Its Generalizations
• Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximation

This page was built for publication: Universal pattern generation by cellular automata