Sticker systems

DOI10.1016/S0304-3975(98)00039-5zbMath0908.68058WikidataQ126383146 ScholiaQ126383146MaRDI QIDQ1275468

Gheorghe Păun, Grzegorz Rozenberg

Publication date: 12 January 1999

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

zbMATH Keywords

DNA computingChomsky hierarchycharacterizations of recursively enumerable languagesequality sets of morphisms

Mathematics Subject Classification ID

Related Items (4)

String assembling systems: comparison to sticker systems and decidability ⋮ Making all spanning tree problem based on sticker model ⋮ P SYSTEMS WITH PROTEINS ON MEMBRANES: A SURVEY ⋮ Some Remarks on Superposition Based on Watson-Crick-Like Complementarity

Cites Work

• DNA computing based on splicing: The existence of universal computers
• Computing by splicing
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sticker systems