Computer Science – Computational Complexity
Scientific paper
2008-08-12
Computer Science
Computational Complexity
12 pages, 4 figures, 2 table. Submitted for possible publication in the International Journal of Computer Mathematics and Appl
Scientific paper
Global dynamics of a non-linear Cellular Automata is, in general irregular, asymmetric and unpredictable as opposed to that of a linear CA, which is highly systematic and tractable. In the past efforts have been made to systematize non-linear CA evolutions in the light of Boolean derivatives and Jacobian Matrices. In this paper two different efforts have been made: first we try to systematize non-linear CA evolution in the light of deviant states and non-deviant states. For all the non-deviant states the nearest linear rule matrix is applicable where as for the deviant states we have a set of other matrices. Second using algebraic manipulation, an efficient algorithm is proposed by which every Non-linear Boolean function can be characterized by a sequence of binary matrices.
Chakraborty Mithun
Choudhury Pabitra Pal
Sahoo Sudhakar
No associations
LandOfFree
Characterization Of any Non-linear Boolean function Using A Set of Linear Operators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Characterization Of any Non-linear Boolean function Using A Set of Linear Operators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterization Of any Non-linear Boolean function Using A Set of Linear Operators will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-202824