Bulking I: An abstract theory of bulking

DOI10.1016/j.tcs.2011.02.023zbMath1264.68115OpenAlexW2052314953MaRDI QIDQ549700

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.023

zbMATH Keywords

classificationcellular automatagroupingbulking

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (11)

On the complexity of two-dimensional signed majority cellular automata ⋮ The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems ⋮ Four states are enough! ⋮ A decomposition theorem for number-conserving multi-state cellular automata on triangular grids ⋮ 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 II: Classifications of cellular automata ⋮ 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

• Bulking II: Classifications of cellular automata
• On real-time cellular automata and trellis automata
• Inducing an order on cellular automata by a grouping operation
• A universal cellular automaton in quasi-linear time and its S-m-n form
• Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
• An Introduction to Symbolic Dynamics and Coding
• Generation of Primes by a One-Dimensional Real-Time Iterative Array
• Endomorphisms and automorphisms of the shift dynamical system
• Unnamed Item
• Unnamed Item

This page was built for publication: Bulking I: An abstract theory of bulking