SavedAdd your journal

Journals / Turkish Journal of Electrical Engineering and Computer Science / 2014 / Cilt: 22 - Sayı: 6

Frequency-emulated uniform cellular automata

Hürevren KILIÇ
Pages
1653–1663
Publication Date
2014-06-01
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Moreover, it is possible to use a 2-emulated uniform CA for the solution of the parity problem.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:The notion of a frequency-emulated (f-emulated) uniform cellular automata (CA) that enables the behavior emulation of some elementary CA via memory usage is introduced.
📊
Key Findings & Data:An algorithm that generates f-emulated uniform CA sets is developed and an upper bound for its output size is given.
💡
Conclusion & Impact:Moreover, it is possible to use a 2-emulated uniform CA for the solution of the parity problem.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Cellular automata · frequency-emulated cellular automata · core emulator set

Abstract

The notion of a frequency-emulated (f-emulated) uniform cellular automata (CA) that enables the behavior emulation of some elementary CA via memory usage is introduced. An algorithm that generates f-emulated uniform CA sets is developed and an upper bound for its output size is given. It is observed that traffic rule 184 together with its 2-emulator version, which generates the behavior of the known majority rule 232, performs the density classification task perfectly. Moreover, it is possible to use a 2-emulated uniform CA for the solution of the parity problem.

Özet

The notion of a frequency-emulated (f-emulated) uniform cellular automata (CA) that enables the behavior emulation of some elementary CA via memory usage is introduced. An algorithm that generates f-emulated uniform CA sets is developed and an upper bound for its output size is given. It is observed that traffic rule 184 together with its 2-emulator version, which generates the behavior of the known majority rule 232, performs the density classification task perfectly. Moreover, it is possible to use a 2-emulated uniform CA for the solution of the parity problem.

🔖

Cite This Article

KILIÇ, H. (2014). Frequency-emulated uniform cellular automata. Turkish Journal of Electrical Engineering and Computer Science, Cilt: 22 - Sayı: 6, 1653–1663. https://ajindex.com/articles/187890

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (9)

  1. J. von Neumann, Theory of self-reproducing cellular automata, University of Illinois, Urbana, 1966. N.H. Packard, “Adaptation toward the edge of chaos”, In: J.A.S. Kelso, A.J. Mandell, and M.F. Shlesinger (eds.), Dynamic Patterns in Complex Systems, World Scientific Singapore, pp. 293–301, 1988. S. Wolfram, “Statistical mechanics of cellular automata”, Reviews of Modern Physics, Vol. 55, pp. 601–644, 1983. [4] S. Wolfram, “A new kind of science”, Champaign, IL: Wolfram Media, Inc. 2002.
  2. M. Mitchell, P.T. Hraber, J.P. Crutchfield, “Revisiting the edge of chaos: Evolving cellular automata to perform computations”, Complex Systems, Vol. 7, pp. 89–130, 1993.
  3. M. Land, R.K. Belew, “No perfect two-state cellular automata for density classification task exists”, Physical Review Letters, Vol. 74, pp. 5148–5150, 1995. M.S. Capcarr`ere, M. Sipper, M. Tomassini, “Two-state, r=1 cellular automaton that classifies density”, Physical Review Letters, Vol. 77, pp. 4969–4971, 1996.
  4. M. Tomassini, M. Venzi, “Evolving robust asynchronous cellular automata for the density task”, Complex Systems, Vol. 13, pp. 185–204, 2002.
  5. S. Sahoo, P.P. Choudry, A. Pal, “Solutions on 1D and 2D density classification problem using programmable cellular automata”, arXiv: 0902.2671 [nlin.CG], 2009.
  6. M. Sipper, Evolution of parallel cellular machines: The cellular programming approach (Lecture Notes in Computer Science), Springer, 1997.
  7. C.L.M. Martins, P.P.B. de Oliveira, “Evolving sequential combinations of elementary cellular automata rules”, Advances in Artificial Life, Lecture Notes in Artificial Intelligence, Vol. 3630, pp. 461–470, 2005. A.R. Gabrielle, “The density classification problem for multi-states cellular automata”, Advances in Artificial Life, Lecture Notes in Artificial Intelligence, Vol. 3630, pp. 443–452, 2005.
  8. C. Stone, L. Bull, “Solving the density classification task using cellular automaton 184 with memory”, Complex Systems, Vol. 18, pp. 329–344, 2009.
  9. R. Alonso-Sanz, L. Bull, “One-dimensional coupled cellular automata with memory: initial investigations”, Journal of Cellular Automata, Vol. 5, pp. 29–49, 2010. N. Fat`es, “Stochastic cellular automata solutions to the density classification problem”, Theory of Computing Systems, 2012, Vol. 53, pp. 223–242, 2013. H. Fuk´s, “Solution of the density classification problem with two cellular automaton rules”, Physical Review E, Vol. 55, pp. 2081–2084, 1997. M. Sipper, “Computing with cellular automata: Three cases for nonuniformity