Abstract
In this study, we obtain the characteristic matrices of three-dimensional cellular automata under the null boundary condition. We examine the inverse of characteristic matrices. We obtain a recurrence equation to determine under what conditions the matrix is invertible. Thanks to this equation, we can calculate the inverse of large-dimensional matrices. Finally, we give some applications of cellular automata. We find the minimal polynomial of the characteristic matrix. We find the cycle length and transition length of the characteristic matrix with the help of minimal polynomials. We also find the attractive points of the characteristic matrix. Finally, we draw the State Transition diagram with the results we obtained.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
