Nondeterministic Seedless Oritatami Systems and Hardness of Testing Their Equivalence

DOI10.1007/978-3-319-43994-5_2zbMath1451.68113OpenAlexW2510905543MaRDI QIDQ2835701

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

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-43994-5_2

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (2)

Rule set design problems for oritatami systems ⋮ Self-Attraction Removal from Oritatami Systems

Uses Software

• Mfold
• KineFold

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