Add to BibSonomyAbstract
Cellular automaton is worth more attention, since it can form a Turing machine which can achieve any computable function.1 Let St(m) (may be logic 1 or 0), m= 0,1,…,M−1, be the state of the mth site at the ith time step in an 1-D elementary cellular automaton with M sites. Then, all the 256 possible local rules1 can be written as
© 1992 Optical Society of America
PDF ArticleMore Like This
Optical Implementation of the stream cipher based on one dimensional Cellular Automata
M. Madjarova, M. Kakuta, M. Yamaguchi, and N. Ohyama
OWC.3 Optics in Computing (IP) 1997
Optical Cellular Automata : Architectural Principles
Pierre Chavel, Jean Taboury, Francis Devos, and Patrick Garda
ThB.3 Optical Bistability (OBI) 1988
Digital optical pipeline cellular automata arithmetic unit
Alastair D. McAulay
OMC3 Optical Computing (IP) 1995