Fluctuation-driven computing on number-conserving cellular automata
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2013806
- A Construction Method of Moore Neighborhood Number-Conserving Cellular Automata
- A characterization of von Neumann neighbor number-conserving cellular automata
- On universality of radius 1/2 number-conserving cellular automata
- Universality and decidability of number-conserving cellular automata
Cites work
- scientific article; zbMATH DE number 1646978 (Why is no real title available?)
- scientific article; zbMATH DE number 3898247 (Why is no real title available?)
- scientific article; zbMATH DE number 2013806 (Why is no real title available?)
- scientific article; zbMATH DE number 1886322 (Why is no real title available?)
- A characterization of important algorithms for quantum-dot cellular automata
- A characterization of von Neumann neighbor number-conserving cellular automata
- A simple model of asynchronous cellular automata exploiting fluctuation
- A survey of Petri net methods for controlled discrete event systems
- Additive conserved quantities in discrete-time lattice dynamical systems
- Asynchronous game of life
- Automata and concurrency
- Brownian cellular automata
- Cellular automata approach to three-phase traffic theory
- Cellular particle swarm optimization
- Computing with random quantum dot repulsion
- Delay-insensitive computation in asynchronous cellular automata
- Non-uniform cellular automata based associative memory: Evolutionary design and basins of attraction
- Number-conserving cellular automata I: Decidability.
- On behavior of two-dimensional cellular automata with an exceptional rule
- On conservative and monotone one-dimensional cellular automata and their particle representation
- Probabilistic cellular automata with conserved quantities
- Regular biosequence pattern matching with cellular automata
- Reversible computing and cellular automata -- a survey
- Synchronous to asynchronous transformation of polyautomata
- Towards a Theory of Universal Speed-Independent Modules
- Universality and decidability of number-conserving cellular automata
Cited in
(6)- Characterization of random fluctuation-based computation in cellular automata
- A novel bio-inspired approach based on the behavior of mosquitoes
- Brownian cellular automata
- Emergence of universal global behavior from reversible local transitions in asynchronous systems
- Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements
- Invertible behavior in elementary cellular automata with memory
This page was built for publication: Fluctuation-driven computing on number-conserving cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454911)
