Universality in Molecular and Cellular Computing

DOI10.1007/978-3-319-20028-6_10zbMath1459.68067OpenAlexW1135444230MaRDI QIDQ3195684

Sergey Verlan

Publication date: 20 October 2015

Published in: Evolving Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20028-6_10

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computability and complexity in self-assembly
• Minimization strategies for maximally parallel multiset rewriting systems
• On small, reduced, and fast universal accepting networks of splicing processors
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• On the reachability problem for 5-dimensional vector addition systems
• Small universal Turing machines
• Small universal register machines
• DNA computing: Arrival of biological mathematics
• Direct constructions of universal extended H systems.
• Frontier between decidability and undecidability: A survey
• Computing with membranes
• Membrane computing. An introduction.
• On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters
• The Complexity of Small Universal Turing Machines: A Survey
• Efficient Turing-Universal Computation with DNA Polymers
• SMALL UNIVERSAL TVDH AND TEST TUBE SYSTEMS
• The Reachability Problem for Vector Addition System with One Zero-Test
• Handbook of Natural Computing
• Further Results on Insertion-Deletion Systems with One-Sided Contexts
• Self-assembly of Decidable Sets
• Insertion-Deletion Systems with One-Sided Contexts
• On Networks of Evolutionary Processors with Nodes of Two Types
• Accepting Networks of Non-inserting Evolutionary Processors
• ON SMALL UNIVERSAL SPLICING SYSTEMS
• TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES
• One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
• Complexity of Self‐Assembled Shapes
• A Formal Framework for Static (Tissue) P Systems
• Small Universal Non-deterministic Petri Nets with Inhibitor Arcs
• 5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
• DNA Computing
• On the size complexity of universal accepting hybrid networks of evolutionary processors

This page was built for publication: Universality in Molecular and Cellular Computing