A Study on the Recurrence for the Transition Functions of Finite Cellular Automata


The KIPS Transactions:PartA, Vol. 14, No. 4, pp. 245-248, Aug. 2007
10.3745/KIPSTA.2007.14.4.245,   PDF Download:

Abstract

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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
H. Y. Lee and G. S. Lee, "A Study on the Recurrence for the Transition Functions of Finite Cellular Automata," The KIPS Transactions:PartA, vol. 14, no. 4, pp. 245-248, 2007. DOI: 10.3745/KIPSTA.2007.14.4.245.

[ACM Style]
Hyen YeaI Lee and Geon Seon Lee. 2007. A Study on the Recurrence for the Transition Functions of Finite Cellular Automata. The KIPS Transactions:PartA, 14, 4, (2007), 245-248. DOI: 10.3745/KIPSTA.2007.14.4.245.