When-and how-can a cellular automaton be rewritten as a lattice gas?

@article{Toffoli2008WhenandHA,
  title={When-and how-can a cellular automaton be rewritten as a lattice gas?},
  author={T. Toffoli and S. Capobianco and P. Mentrasti},
  journal={Theor. Comput. Sci.},
  year={2008},
  volume={403},
  pages={71-88}
}
  • T. Toffoli, S. Capobianco, P. Mentrasti
  • Published 2008
  • Physics, Computer Science, Mathematics
  • Theor. Comput. Sci.
  • Both cellular automata (CA) and lattice-gas automata (LG) provide finite algorithmic presentations for certain classes of infinite dynamical systems studied by symbolic dynamics; it is customary to use the terms 'cellular automaton' and 'lattice gas' for a dynamic system itself as well as for its presentation. The two kinds of presentation share many traits but also display profound differences on issues ranging from decidability to modeling convenience and physical implementability. Following… CONTINUE READING
    Cellular Automata and Discrete Complex Systems
    • 9
    • PDF
    When is a quantum cellular automaton (QCA) a quantum lattice gas automaton (QLGA)
    • 13
    • PDF
    What Automata Can Provide a Medium for Life?
    Multidimensional Cellular Automata and Generalization of Fekete's Lemma
    • 14
    • PDF
    Bounds on Non-surjective Cellular Automata
    • 6
    • PDF
    A synchronous cellular automaton model of mass transport in porous media
    • 7

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 61 REFERENCES
    Cellular automata machines - a new environment for modeling
    • 1,102
    • PDF
    How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme
    • 11
    Reversible space-time simulation of cellular automata
    • 17
    • PDF
    Classifying circular cellular automata
    • 185
    Theory of cellular automata: A survey
    • J. Kari
    • Mathematics, Computer Science
    • 2005
    • 512
    • PDF
    Time/Space Trade-Offs for Reversible Computation
    • 317
    • PDF
    On the Circuit Depth of Structurally Reversible Cellular Automata
    • J. Kari
    • Computer Science, Mathematics
    • 1999
    • 29
    An Introduction to Kolmogorov Complexity and Its Applications
    • 3,541
    • PDF