Abstract
Cellular automata are treated as neural nets and linearized in functional space. The solution of the inverse problem is exhibited. Additive automata correspond to nets of monomial non-separable Boolean functions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
