Universality and decidability of number-conserving cellular automata-Reference-Cited by-同舟云学术

Universality and decidability of number-conserving cellular automata

Published:2003-01 Issue:3 Volume:292 Page:711-721
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Moreira Andrés

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference16 articles.

1. A simple universal cellular automaton and its one-way and totalistic version;Albert;Complex Systems,1987

2. Bilinear cellular automata;Bartlett;Complex Systems,1995

3. N. Boccara, H. Fukś, Cellular automaton rules conserving the number of active sites. J. Phys. A 31 (1998) 6007–6018. Also http://xxx.lanl.gov/ps/adap-org/9712003.

4. N. Boccara, H. Fukś, Number-conserving cellular automaton rules, Fundamenta Informaticae (2000), to appear. Also http://xxx.lanl.gov/ps/adap-org/9905004.

5. Complex chaotic behaviour of a class of subshift cellular automata;Braga;Complex Systems,1993

Cited by 29 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A decomposition theorem for number-conserving multi-state cellular automata on triangular grids;Theoretical Computer Science;2023-04

2. Deterministic cellular automata resembling diffusion;International Journal of Modern Physics C;2022-05-21

3. The Weak Universality of Two-Dimensional Five-State von Neumann Neighborhood Number-Conserving Cellular Automaton;New Generation Computing;2022-01-09

4. Construction of One-Dimensional Nonuniform Number Conserving Elementary Cellular Automata Rules;International Journal of Bifurcation and Chaos;2021-04

5. Efficient enumeration of three-state two-dimensional number-conserving cellular automata;Information and Computation;2020-10