Camilo Cruz
ABSTRACT
In this paper, we present an exploration of digital morphogenesis in architecture, using a composite Cellular Automata (CA). This model allows us to produce a vast array of different spatial topologies by evolving the boundaries of spatial units. This approach focuses on the formation of spatial patterns, where their characteristics emerge as consequence of the evolution of the system, rather than being prescribed by design. The experiment presented her investigates whether the composite CA is capable of generating aggregate spatial units to match the characteristics of specific spatial configurations.
- C. Cruz phet al. Towards the implementation of a composite CA model for the exploration of design space. In S.-F. Chien phet al. editors, CAADRIA 2016, pages 187--196. CAADRIA, 2016.Google Scholar
- H. A. Simon. The Sciences of the Artificial. MIT Press, third edition, 1996. Google ScholarDigital Library
- S. Wolfram. Universality and complexity in cellular automata. Physica D: Nonlinear Phenomena, 10(1):1--35, 1984.Google ScholarCross Ref
Index Terms
- A Morphogenetic Design Strategy Using a Composite CA Model
Recommendations
Analysis of complemented CA derived from linear hybrid group CA
In this paper, we analyze complemented group Cellular Automata (CA) derived from Linear Hybrid Group CA with rules 60, 102 and 204. We analyze some properties of the CA. And we give rule vectors which determine the state transition of the CA dividing ...
Input-driven languages are linear conjunctive
Linear conjunctive grammars define the same family of languages as one-way real-time cellular automata (A. Okhotin, "On the equivalence of linear conjunctive grammars to trellis automata", RAIRO ITA, 2004), and this family is known to be incomparable ...
Iterated uniform finite-state transducers on unary languages
AbstractAn iterated uniform finite-state transducer executes the same length-preserving transduction in iterative sweeps. The first sweep occurs on the input string, while any subsequent sweep works on the output of the previous one. All sweeps always ...
Highlights- We study Iterated Uniform Finite-State Transducers (IUFSTs) working on unary languages.
- We compare IUFSTs size with that of unary classical finite-state automata.
- We relate IUFSTs and one-way cellular automata recognition power.
Comments