Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #1 to #50.

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

  1. Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models: Label: en
  2. Language Recognition by Reversible Partitioned Cellular Automata: Label: en
  3. Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results: Label: en
  4. Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces: Label: en
  5. Cycle Equivalence of Finite Dynamical Systems Containing Symmetries: Label: en
  6. Real-Time Reversible One-Way Cellular Automata: Label: en
  7. A Universal Cellular Automaton Without Sensitive Subsystems: Label: en
  8. 5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal: Label: en
  9. Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles: Label: en
  10. Complexity of One-Way Cellular Automata: Label: en
  11. Plane-Walking Automata: Label: en
  12. Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2: Label: en
  13. Recognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata: Label: en
  14. Restricted Density Classification in One Dimension: Label: en
  15. Group-Walking Automata: Label: en
  16. Network Structure and Activity in Boolean Networks: Label: en
  17. Merging Cellular Automata Rules to Optimise a Solution to the Modulo-n Problem: Label: en
  18. On the Periods of Spatially Periodic Preimages in Linear Bipermutive Cellular Automata: Label: en
  19. The Ideal Energy of Classical Lattice Dynamics: Label: en
  20. Universal Time-Symmetric Number-Conserving Cellular Automaton: Label: en
  21. Shrinking One-Way Cellular Automata: Label: en
  22. L-Convex Polyominoes Are Recognizable in Real Time by 2D Cellular Automata: Label: en
  23. Remarks on the Cellular Automaton Global Synchronisation Problem: Label: en
  24. Classification of Elementary Cellular Automata Up to Topological Conjugacy: Label: en
  25. Hard Core via PCA: Entropy Bounds: Label: en
  26. A Cellular Automaton for Blocking Queen Games: Label: en
  27. Effect of Graph Structure on the Limit Sets of Threshold Dynamical Systems: Label: en
  28. A Physically Universal Quantum Cellular Automaton: Label: en
  29. Groups and Monoids of Cellular Automata: Label: en
  30. Tag Systems and the Complexity of Simple Programs: Label: en
  31. Cellular Automaton Models for Collective Cell Behaviour: Label: en
  32. Cellular Automata on Group Sets and the Uniform Curtis-Hedlund-Lyndon Theorem: Label: en
  33. An 8-State Simple Reversible Triangular Cellular Automaton that Exhibits Complex Behavior: Label: en
  34. Shrinking and Expanding Cellular Automata: Label: en
  35. Constant Acceleration Theorem for Extended von Neumann Neighbourhoods: Label: en
  36. Two-Dimensional Traffic Rules and the Density Classification Problem: Label: en
  37. Partial Reversibility of One-Dimensional Cellular Automata: Label: en
  38. Sum of Exit Times in Series of Metastable States in Probabilistic Cellular Automata: Label: en
  39. On Finite Monoids of Cellular Automata: Label: en
  40. An “almost dual” to Gottschalk’s Conjecture: Label: en
  41. Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata: Label: en
  42. The Group of Reversible Turing Machines: Label: en
  43. The Corona Limit of Penrose Tilings Is a Regular Decagon: Label: en
  44. A Brief Tour of Theoretical Tile Self-Assembly: Label: en
  45. What Automata Can Provide a Medium for Life?: Label: en
  46. Propagation, Diffusion and Randomization in Cellular Automata: Label: en
  47. On Polynomial Rings in Information Dynamics of Linear CA: Label: en
  48. Commutators of Bipermutive and Affine Cellular Automata: Label: en
  49. Color Blind Cellular Automata: Label: en
  50. On the Convergence of Boolean Automata Networks without Negative Cycles: Label: en

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)