Non-uniform number-conserving elementary cellular automata
From MaRDI portal
Publication:6496149
Cites work
- scientific article; zbMATH DE number 1634459 (Why is no real title available?)
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 3896307 (Why is no real title available?)
- scientific article; zbMATH DE number 729555 (Why is no real title available?)
- scientific article; zbMATH DE number 1070886 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- A cellular automaton model for two-lane traffic.
- Cellular automata approach to three-phase traffic theory
- Characterization of Reachable/Nonreachable Cellular Automata States
- Construction of one-dimensional nonuniform number conserving elementary cellular automata rules
- Group Properties of Cellular Automata and VLSI Applications
- Local rule distributions, language complexity and non-uniform cellular automata
- Non-uniform Cellular Automata
- Non-uniform cellular automata: classes, dynamics, and decidability
- Number conservation property of elementary cellular automata under asynchronous update
- On conservative and monotone one-dimensional cellular automata and their particle representation
- On synthesis of non-uniform cellular automata having only point attractors
- Reachability problem in non-uniform cellular automata
- Realization problems for nonuniform cellular automata
- The cellular automaton interpretation of quantum mechanics
- Twenty Problems in the Theory of Cellular Automata
This page was built for publication: Non-uniform number-conserving elementary cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496149)
