scientific article; zbMATH DE number 3338162
From MaRDI portal
Publication:5615059
zbMath0213.18301MaRDI QIDQ5615059
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (70)
Modeling artificial biological cell in fine-grained structure ⋮ Universal map for cellular automata ⋮ Self-reproduction in a reversible cellular space ⋮ Random context structure grammars and automata - a formal approach ⋮ Cellular automata as a paradigm for ecological modeling ⋮ Construction universality in purely asynchronous cellular automata ⋮ Co-evolving non-uniform cellular automata to perform computations ⋮ Emergence of self-replicating structures in a cellular automata space ⋮ Universal asynchronous iterative arrays of Mealy automata ⋮ Asynchronous self-reproducing loops with arbitration capability ⋮ Four states are enough! ⋮ Itérations sur des ensembles finis et automates cellulaires contractants ⋮ Regional Control of Probabilistic Cellular Automata ⋮ Optimal and suboptimal regional control of probabilistic cellular automata ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Logical Gates via Gliders Collisions ⋮ Computation and Pattern Formation by Swarm Networks with Brownian Motion ⋮ Behavior of complemented CA whose complement vector is acyclic in a linear TPMACA. ⋮ Synchronous to asynchronous transformation of polyautomata ⋮ Parallel language recognition in constant time by cellular automata ⋮ Cellular automata supporting \(n\)-connectivity ⋮ On the relationship between cellular automata and L-systems: The self-replication case ⋮ Problem solving during artificial selection of self-replicating loops ⋮ Self-adaptive self-reproductions in cellular automata ⋮ Parasites at the origin of life ⋮ Computing by Swarm Networks ⋮ Exploring CA State Space to Synthesize Cellular Automata with Specified Attractor Set ⋮ Artificial intelligence techniques: An introduction to their use for modelling environmental systems ⋮ PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT† ⋮ Second-level algorithms, superrecursivity, and recovery problem in distributed systems ⋮ Cellular automaton model for railway traffic ⋮ Completeness problem of one-dimensional binary scope-3 tessellation automata ⋮ Graph automata: Natural expression of self-reproduction ⋮ Survey of research in the theory of homogeneous structures and their applications ⋮ Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata ⋮ Computer simulation of reverberating spreading depression in a network of cell automata ⋮ Delay-insensitive computation in asynchronous cellular automata ⋮ The behavioral properties of homogeneous structures ⋮ Theory of cellular automata: a survey ⋮ Toward a viable, self-reproducing universal computer ⋮ The vector string descriptor as a tool in the analysis of cellular automata systems ⋮ Computation and construction universality of reversible cellular automata ⋮ A note on asynchronous cellular automata ⋮ (A-)synchronous (non)-deterministic cell spaces simulating each other ⋮ Characterization of Single Cycle CA and its Application in Pattern Classification ⋮ Morphogenetic systems for resource bounded computation and modeling ⋮ A completeness problem for pattern generation in tessellation automata ⋮ Shift-symmetric configurations in two-dimensional cellular automata: Irreversibility, insolvability, and enumeration ⋮ The constructibility of a configuration in a cellular automaton ⋮ Emulating cellular automata in chemical reaction-diffusion networks ⋮ Surprising Areas in the Quest for Small Universal Devices ⋮ Tessellation structures for reproduction of arbitrary patterns ⋮ A contribution to the methodology of biomathematics: Information science approach to biomathematics. I ⋮ Self-reproduction in small cellular automata ⋮ Confusion in the Garden of Eden ⋮ Some regular state sets in the system of one-dimensional iterative automata ⋮ Sexually reproducing cellular automata ⋮ Frontier between decidability and undecidability: A survey ⋮ Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures ⋮ On universal computer-constructors ⋮ Real-time language recognition by one-dimensional cellular automata ⋮ Nonconstructible blocks in 1D cellular automata: minimal generators and natural systems ⋮ 5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal ⋮ On self-modifying programs ⋮ Unnamed Item ⋮ Linear cellular automata over \(Z_ m\) ⋮ Recursively Generated Evolutionary Turing Machines and Evolutionary Automata ⋮ Wolfram's class IV automata and a good Life ⋮ An extended strange planet protocol ⋮ Fast parallel language recognition by cellular automata
This page was built for publication:
