Implementation of Combinational Logic Circuits Using Nearest-Neighbor One-Dimensional Four-State Cellular Automata
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
Cellular automata are simple mathematical idealizations of natural systems. They consist of a lattice of discrete identical sites, each site taking on a finite set of, say, integer values. Over the years, scientists have been trying to investigate the computational capabilities of cellular automata by limiting the dimension, neighborhood radius, and the number of states.In this article, we represent a novel implementation of combinational logic circuits using nearest-neighbor one-dimensional four-state cellular automata (CA). The novelty behind the proposed model is the reduction of the required number of states and yet being able to implement combinational logic-circuits in the conventional CA fashion. This can open a new window to the computation using cellular automata.
Keywords:
Language:
English
Published:
Journal of Algorithms and Computation, Volume:52 Issue: 2, Dec 2020
Pages:
41 to 56
https://www.magiran.com/p2230901
سامانه نویسندگان
مقالات دیگری از این نویسنده (گان)
-
LP problems constrained with D-FRIs
A. Ghodousian *, M. Jafarpour
Journal of Algorithms and Computation, Dec 2018 -
Normalized Tenacity and Normalized Toughness of Graphs
A. Javan *, M. Jafarpour, D. Moazzami, A. Moieni
Journal of Algorithms and Computation, Dec 2017