Abstract
This paper reports the solution of the problem of finding which inputs for a function of discrete variables will result in any specified output for the set of binomially determined nearest neighbor additive cellular automata defined on finite or half-infinite sequences. In computing the solution to this problem a process which is the discrete analog to backward integration is defined. This process is determined in terms of an operator which exhibits an interesting period multiplying property.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have