Bulking II: Classifications of cellular automata

DOI10.1016/j.tcs.2011.02.024zbMath1264.68116OpenAlexW1592403432MaRDI QIDQ549701

Yong-Cai Geng, Sumit K. Garg

Publication date: 18 July 2011

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

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

zbMATH Keywords

classificationcellular automatagroupingbulking

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (15)

Towards intrinsically universal asynchronous CA ⋮ On the complexity of two-dimensional signed majority cellular automata ⋮ The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems ⋮ Four states are enough! ⋮ Communication complexity meets cellular automata: necessary conditions for intrinsic universality ⋮ On time-symmetry in cellular automata ⋮ On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One ⋮ Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles ⋮ Bulking I: An abstract theory of bulking ⋮ Traced communication complexity of cellular automata ⋮ Permutive one-way cellular automata and the finiteness problem for automaton groups ⋮ On hardest languages for one-dimensional cellular automata ⋮ On the complexity of asynchronous freezing cellular automata ⋮ The mirage of universality in cellular automata ⋮ The two-handed tile assembly model is not intrinsically universal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bulking I: An abstract theory of bulking
• Firing squad synchronization problem in reversible cellular automata
• Directional dynamics for cellular automata: A sensitivity to initial condition approach
• Computation theory of cellular automata
• On the limit set of some universal cellular automata
• Inducing an order on cellular automata by a grouping operation
• Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results
• Cellular automata and intermediate degrees.
• Subshifts of finite type and sofic systems
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• On the Limit Sets of Cellular Automata
• P-completeness of Cellular Automaton Rule 110
• Classes of linear automata
• The Nilpotency Problem of One-Dimensional Cellular Automata
• Languages, equicontinuity and attractors in cellular automata
• An Introduction to Symbolic Dynamics and Coding
• Mathematical Foundations of Computer Science 2004
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• Endomorphisms and automorphisms of the shift dynamical system
• Simple Computation-Universal Cellular Spaces
• STACS 2005

This page was built for publication: Bulking II: Classifications of cellular automata