Abstract
이 논문은 셀의 두 가지 상태값(0,1)과 서로 다른 네가지 경계조건(0-0,0-1,1-0,1-1)하에서, 3근방 국소 천이함수를 갖는 유한오토마타의 천이함수를 생성하는 간단한 재귀적인 공식을 만들어, 이 공식으로 천이 함수를 몇 개의 클래스로 분류한다. This paper provides some simple recursive formulas generation transition functions of finite cellular automata with triplet local transition functions under two states (0 and 1) and four different boundary conditions (0-0,0-1,1-0,1-1), and classify transition functions into several classes.
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.
