Analysis of Reachable/Nonreachable States of 3-neighborhood Cellular Automata

3-이웃 셀룰라 오토마타의 도달 가능/불가능 상태 분석

  • Published : 2006.06.01

Abstract

In this paper, we analyze reachable/nonreachable states of 3-neighborhood cellular automata and propose the algorithm finding the predecessor of a reachable state.

본 논문에서는 3-이웃 셀룰라 오토마타의 도달 가능/불가능한 상태를 분석하고 도달가능 상태의 직전자를 구하는 알고리즘을 제안한다.

Keywords

References

  1. S. Wolfram, O. Martin and A. M. Odlyzko, Algebraic properties of cellular automata Communications in Mathematical Physics, 3, pp. 219-258,1984
  2. K. Cattell and J. Muzio, Analysis of one-dimensional linear hybrid cellular automata over GF(q), IEEE Transactions of Computers, Vol. 45(7), pp. 782-792, 1996 https://doi.org/10.1109/12.508317
  3. S.J. Cho, U.S. Choi, and H.D. Kim, Analysis of complemented CA derived from a linear TPMACA, Computers and Mathematics with Applications, Vol.45, pp. 689-698, 2003 https://doi.org/10.1016/S0898-1221(03)00028-2
  4. S.J. Cho, U.S. Choi, Y.H. Hwang, H.D. Kim and Y.S. Pyo, Analysis of state-transition of SACA over GF($2^{p}$), J. Kor. Info. Security and Cryptology, Vol.15 , pp. 105-111, 2005
  5. S.T. Kim, S.K. Lee, U.S. Choi and S.J. Cho, TPSACA 를 이용한 완전 해싱 알고리즘, 한국해양정보통신학회, 제8권 제6호, pp. 1047-1054, 2004
  6. S.J. Cho, S.T. Kim and U.S. Choi, Complemented CA derived from linear Two-Predecessor MACA, 한국해양정보통신학회, 제5권 제2호, pp. 365-370, 2001
  7. S. Das, B. K. Sikdar and P. P. Chaudhuri, Characterization of reachable/ nonreachable cellular automata states, LNCS 3305, pp. 813-822, 2004