The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
; Kharagpur); Pal Chaudhuri, Parimal (6-1]TKH-C; Kharagpur) Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines. ... A special class of nongroup cellular automata de- noted D1I*CA is analytically investigated. ...
Since the inception of cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention of several researchers over various backgrounds and fields for modelling different physical, natural ... Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from simple local interaction and computation. ... Acknowledgements The authors gratefully acknowledge the anonymous reviewers for their comments and suggestions, which have helped to improve the quality and readability of the paper. ...arXiv:1607.02291v3 fatcat:nvvcvjlupvdtpdz34kii2ovt5m
(English summary) 97g:68166 Chakraborty, Supratik (with Roy Chowdhury, Dipanwita; Pal Chaudhuri, Parimal) Theory and application of nongroup cellular automata for synthesis of easily testable finite state ... Efficient implementation of neighborhood logic for cellular automata via the cellular neural network universal machine. (English summary) Doring, Andreas C. Deriving invariants for cellular automata. ...