Nondeterministic seedless oritatami systems and hardness of testing their equivalence

DOI10.1007/S11047-017-9661-YzbMath1528.68119OpenAlexW2772803310MaRDI QIDQ6061982

Makoto Ota, Hwee Kim, Shinnosuke Seki, Yo-Sub Han

Publication date: 30 November 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-017-9661-y

zbMATH Keywords

nondeterminismself-assemblyoritatami systemRNA cotranscriptional folding

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Protein sequences, DNA sequences (92D20) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (2)

Impossibility of strict assembly of infinite fractals by oritatami ⋮ Transcript design problem of oritatami systems

Cites Work

• Complexity classes in models of cellular computing with membranes
• On Relating Time and Space to Size and Depth
• Programming Biomolecules That Fold Greedily During Transcription

This page was built for publication: Nondeterministic seedless oritatami systems and hardness of testing their equivalence