Transient and Cycle Structure of Elementary Rule 150 with Reflective Boundary

Cellular automata are simple mathematical representation of complex dynamical systems. Therefore there are several applications of cellular automata in many areas such as coding, cryptography, VLSI design [1,2]. In this study, a recurrence relation for computation minimal polynomial of transition matrix of linear elementary rule $150$ with reflective boundary condition [3] was obtained. Then, the maximum transient and cycle lengths of this rule were calculated by algorithm in [4].\

\textbf{Acknowledgements:} The work is supported by T\"{U}B.{I}TAK (Project Number: 110T713).