sebuah review singkat terhadap emulasi CeLlular Automata pada mesin turing
Hernawan Sulistyanto(1*)(1) Program Studi Teknik Infomatika, Fak. Komunikasi dan Informatika, Universitas Muhammadiyah Surakarta
(*) Corresponding Author
Abstract
Full Text:
PDFReferences
Davis, M. 2000. The Universal Computer: The Road from Leibniz to Turing. New York: Norton.
Hopcroft, J.E., R. Motwani, and J. D. Ullman. 2001. Introduction to Automata Theory, Languange, and Computation. Edisi ke-2. Addison-Wesley
Maida, K., dan C. Sakama. 2007. Identifying Celullar Automata rules, in Journal of Celullar Automata,
Vol. 2, pp. 1-20.
Martin, O., A. M. Odlyzko, and S. Wolfram. 1984. Algebraic properties of Celullar Aotumata, Communications in Mathematical Physics, Springer-Verlag.
Mitchell, M. 1998. Computation in Celullar Automata, in Nonstandard Computation, pp. 95-140. Weinheim
Sipser, M. 2013. Introduction to the theory of computation, 3rd Ed, Cengage Learning, Boston USA.
Wegener, I. 2003. Complexity Theory: Exploring the limits of efficient algorithms, Springer-Verlag, Berlin.
Wolfram, S. 2002. A New Kind of Science. Champaign, IL: Wolfram Media Inc.
Zvi Kohavi, Z. 2005. Switching and Finite Automata Theory, McGraw-Hill.
Article Metrics
Abstract view(s): 884 time(s)PDF: 1049 time(s)
Refbacks
- There are currently no refbacks.