ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

确定性元胞自动机×随机元胞自动机×
领域仿真仿真
方法族Process / pipelineProcess / pipeline
起源年份1940s–1950s1940s–1980s
提出者John von Neumann and Stanislaw Ulamvon Neumann, J. / Ulam, S. (deterministic CA); probabilistic extension formalized by various authors including Wolfram, S. and Chopard, B.
类型Discrete deterministic grid simulationGrid-based stochastic simulation
开创性文献von Neumann, J. (1966). Theory of Self-Reproducing Automata. University of Illinois Press, Urbana, IL. (Edited and completed by A. W. Burks.) link ↗Wolfram, S. (2002). A New Kind of Science. Wolfram Media, Champaign, IL. ISBN: 9781579550080
别名Deterministic CA, Classical Cellular Automata, Rule-based CA, Finite Automata Grid ModelSCA, Probabilistic Cellular Automata, PCA, Stochastic CA
相关65
摘要Deterministic Cellular Automata (DCA) is a simulation method that models the evolution of complex systems through a regular grid of cells, each holding a discrete state, updated synchronously at each time step according to a fixed, deterministic rule applied to the cell and its neighbors. The outcome is fully reproducible given the same initial conditions and rule set.Stochastic Cellular Automata (SCA) extend classical cellular automata by replacing deterministic transition rules with probabilistic ones, allowing each cell on a grid to change state according to a probability distribution conditioned on its neighborhood. This makes SCA a powerful tool for simulating real-world spatial processes where randomness, noise, and uncertainty govern local interactions — from epidemic spread and forest fires to traffic flow and material diffusion.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Deterministic Cellular Automata · Stochastic Cellular Automata. 于 2026-06-18 检索自 https://scholargate.app/zh/compare