A DNA computing inspired computational model

DOI10.1016/J.TCS.2008.04.013zbMath1151.68017OpenAlexW1988002982MaRDI QIDQ953543

Maurice Margenstern, Giuditta Franco

Publication date: 6 November 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.013

zbMATH Keywords

DNA computingmembrane systemsdouble string structureregister machine program

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

Related Items (1)

Algorithmic applications of XPCR

Cites Work

• Unnamed Item
• Unnamed Item
• Small universal Turing machines
• DNA computing. New computing paradigms.
• Membrane computing. An introduction.
• An algorithmic analysis of DNA structure
• Computing by Floating Strings
• ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON
• Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity
• Logical Reversibility of Computation
• On quasi-unilateral universal Turing machines

This page was built for publication: A DNA computing inspired computational model