Universality and decidability of number-conserving cellular automata

@article{Moreira2003UniversalityAD,
  title={Universality and decidability of number-conserving cellular automata},
  author={Andr{\'e}s Moreira},
  journal={Theor. Comput. Sci.},
  year={2003},
  volume={292},
  pages={711-721}
}
  • Andrés Moreira
  • Published in Theor. Comput. Sci. 2003
  • Mathematics, Computer Science
  • Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the definition of the property to include cellular automata with any set of states in Z, and show that they can be always extended to "usual" NCCA with contiguous states. We show a way to simulate any one dimensional CA through a one-dimensional NCCA, proving the… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 34 CITATIONS

    Communication complexity in number-conserving and monotone cellular automata

    VIEW 15 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Freezing, Bounded-Change and Convergent Cellular Automata

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Cellular Automata: Reversibility, Semi-reversibility and Randomness

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Particle Complexity of Universal Finite Number-Conserving Cellular Automata

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Realization problems for nonuniform cellular automata

    • Ville Salo
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 2014

    Fluctuation-driven computing on number-conserving cellular automata

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 15 REFERENCES

    Number Conserving Cellular Automata and Particle Representation

    • A. Moreira, N. Boccara, E. Goles
    • Preprint.
    • 2001
    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Number-conserving cellular automaton rules

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Ω-languages

    VIEW 2 EXCERPTS

    Bilinear Cellular Automata

    VIEW 2 EXCERPTS