Complexity and Universality of Iterated Finite Automata

First Page		Document Content
Date: 2012-09-20 14:37:05 Automata theory Computer science Cellular automata Computability theory Cellular automaton Finite-state machine Finite state transducer A New Kind of Science Turing machine Theory of computation Models of computation Theoretical computer science		Complexity and Universality of Iterated Finite Automata Add to Reading List Source URL: www.complex-systems.com Download Document from Source Website File Size: 1,43 MB Share Document on Facebook

	A Structurally Dynamic Cellular Automaton with Memory in the Triangular Tessellation Ramón Alonso-Sanz ETSI Agrónomos (Estadística), C. Universitaria, Madrid, Spain DocID: 1v551 - View Document
	Implementing Per Bak’s Sand Pile Model as a Two-Dimensional Cellular Automaton Leigh Tesfatsion 21 January 2009 Econ 308 Presentation Outline DocID: 1uxU0 - View Document
	Complex Shift Dynamics of Some Elementary Cellular Automaton Rules DocID: 1tUbH - View Document
	The Most General Conservation Law for a Cellular Automaton Enrico Formenti1? , Jarkko Kari2?? , and Siamak Taati32 1 Universit´e de Nice-Sophia Antipolis, D´epartment d’Informatique, DocID: 1rqpP - View Document
	� EMAPS : AN EXTENDABLE, OBJECT-ORIENTED GIS Stephen M. Ervin, Associate Professor Department of Landscape Architecture Harvard University Graduate School of Design DocID: 1rp0y - View Document