Cellular Automaton Belousov–Zhabotinsky Model for Binary Full Adder

DOI10.1142/S0218127417500894zbMath1370.68212OpenAlexW2729421105MaRDI QIDQ5357171

Nikolaos I. Dourvas, Andrew Adamatzky, Georgios Ch. Sirakoulis

Publication date: 14 September 2017

Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218127417500894

zbMATH Keywords

wavescellular automataexcitable mediaexcitationBelousov-Zhabotinsky reactionunconventional computingadder

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Mathematical problems of computer architecture (68M07)

Related Items (1)

Power Consumption in Cellular Automata

Cites Work

• Unnamed Item
• Unnamed Item
• On logical gates in precipitating medium: cellular automaton model
• Theory of multicolor lattice gas: A cellular automaton Poisson solver
• Cellular automata model for the diffusion equation
• Three-valued logic gates in reaction-diffusion excitable media
• PHENOMENOLOGY OF REACTION–DIFFUSION BINARY-STATE CELLULAR AUTOMATA
• ON MEMORY AND STRUCTURAL DYNAMISM IN EXCITABLE CELLULAR AUTOMATA WITH DEFENSIVE INHIBITION
• ON MULTITASKING IN PARALLEL CHEMICAL PROCESSORS: EXPERIMENTAL FINDINGS

This page was built for publication: Cellular Automaton Belousov–Zhabotinsky Model for Binary Full Adder