Bulking I: An abstract theory of bulking
From MaRDI portal
Publication:549700
DOI10.1016/J.TCS.2011.02.023zbMATH Open1264.68115OpenAlexW2052314953MaRDI QIDQ549700FDOQ549700
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
Recommendations
Cites Work
- An Introduction to Symbolic Dynamics and Coding
- Endomorphisms and automorphisms of the shift dynamical system
- Bulking II: Classifications of cellular automata
- A universal cellular automaton in quasi-linear time and its S-m-n form
- Title not available (Why is that?)
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
- Inducing an order on cellular automata by a grouping operation
- Title not available (Why is that?)
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
- On real-time cellular automata and trellis automata
Cited In (12)
- The two-handed tile assembly model is not intrinsically universal
- Bulking II: Classifications of cellular automata
- Four states are enough!
- Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles
- On the complexity of two-dimensional signed majority cellular automata
- The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems
- On the complexity of asynchronous freezing cellular automata
- The mirage of universality in cellular automata
- On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One
- On hardest languages for one-dimensional cellular automata
- A decomposition theorem for number-conserving multi-state cellular automata on triangular grids
- Simulation limitations of affine cellular automata
This page was built for publication: Bulking I: An abstract theory of bulking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549700)
