1 |
P.H. Bardell, 'Analysis of cellular auto- mata used as pseudorandom pattern generators,' Proc. IEEE int. Test. Conf., pp. 762-767, 1990
|
2 |
S. Chakraborty, D.R. Chowdhury and P.P. Chaudhuri, 'Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines,' IEEE, Trans, Computers, 45, pp. 769-781, 1996
DOI
ScienceOn
|
3 |
P.P. Chaudhuri, D.R. Chowdhury, S. Nandy and Chattopadhyay, Additive cellular automata theory and application, 1, IEEE Computer Society Press, California, 1997
|
4 |
S.J. Cho, H.D. Kim and U.S. Choi, 'Behavior of complemeted cellular automata derived from a linear cellular automata,' Mathematical and Computer Modelling, 36, pp. 979-986, 2002
DOI
ScienceOn
|
5 |
S.U. Guan and S.K. Tan, 'Pseudorandom number generation with self-programmable cellular automata,' IEEE Transaction on computer-aided design of integrated circuits and systems, 23(7), pp. 1095-1101, 2004
DOI
ScienceOn
|
6 |
S. Chattopadhyay, S. Adhikari, S. Sengupta and M. Pal, 'Highly regular, modular, and cascadable design of cellular automata-based pattern classifier,' IEEE Transactions on VLSI systems, 8(6), pp 724-734, 2000
DOI
ScienceOn
|
7 |
S.J. Cho, U.S. Choi, H.D. Kim, Y.H. Hwang and J.K, Kim, 'Analysis of 90/150 two predecessor nongroup cellular automata,' LNCS 5191, pp. 128-135, 2008
DOI
ScienceOn
|
8 |
R.A. Horn and C.R. Johnson, Matrix analysis, Cambridge university Press, 1985
|