Construction of Reversible Lattice Molecular Automata
نویسنده
چکیده
Several cellular automata (CA) models have been developed to simulate self-organization of multiple levels of structures. However, they do not obey microscopic reversibility and conservation laws. In this paper, we describe the construction of a reversible lattice molecular automata (RLMA) model, which simulates molecular interaction and selforganization of higher-order structures. The model’s strict reversibility entails physically relevant conservation laws, and thus opens a way to precise application and validation of the methods from statistical physics in studying the necessary conditions for such multiple levels of self-organization.
منابع مشابه
Lattice Gas Automata Simulation of Adsorption Process of Polymer in Porous Media
Lattice gas automata (LGA) model is developed to simulate polymer adsorption process by adding some collision rules. The simulation result of the model is matched with batch experiment and compared with accepted isothermal adsorption equations. They show that the model is viable to perform simulation of the polymer adsorption process. The LGA model is then applied for simulating continuous poly...
متن کاملComputation and Construction Universality of Reversible Cellular Automata
An arbitrary d-dimensional cellular automaton can be constructively embedded in a reversible one having d + 1 dimensions. In particular, there exist computationand construction-universal reversible cellular automata. Thus, we explicitly show a way of implementing nontrivial irreversible processes in a reversible medium. Finally, we derive new results for the bounding problem for configurations,...
متن کاملOn generalization of reversible second-order cellular automata
A cellular automaton with n states may be used for construction of reversible second-order cellular automaton with n states. Reversible cellular automata with hidden parameters discussed in this paper are generalization of such construction and may have number of states N = nm with arbitrary m. Further modification produces reversible cellular automata with reduced number of states N ′ < N = nm.
متن کاملFinite Automata Based on Quantum Logic and Their Determinization
We give the quantum subset construction of orthomodular lattice-valued finite automata, then we show the equivalence between orthomodular lattice-valued finite automata, orthomodular lattice-valued deterministic finite automata and orthomodular lattice-valued finite automata with empty string-moves. Based on these equivalences, we study the algebraic operations on orthomodular lattice-valued re...
متن کاملGENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED
The present paper has been an attempt to investigate the general fuzzy automata on the basis of complete residuated lattice-valued ($L$-GFAs). The study has been chiefly inspired from the work by Mockor cite{15, 16, 17}. Regarding this, the categorical issue of $L$-GFAs has been studied in more details. The main issues addressed in this research include: (1) investigating the relationship betwe...
متن کامل