A general architecture of oritatami systems for simulating arbitrary finite automata
DOI10.1007/978-3-030-23679-3_12zbMath1504.68066arXiv1904.10174OpenAlexW3120697551MaRDI QIDQ5918272
Yo-Sub Han, Hwee Kim, Yusei Masuda, Shinnosuke Seki
Publication date: 3 June 2021
Published in: Theoretical Computer Science, Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.10174
nondeterministic finite automatonoritatami systemmolecular self-assemblyRNA cotranscriptional folding
Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Towards the algorithmic molecular self-assembly of fractals by cotranscriptional folding
- Know when to fold 'em: self-assembly of shapes by folding in oritatami
- Construction of geometric structure by oritatami system
- Automatic Sequences
- Programming Biomolecules That Fold Greedily During Transcription
- A general architecture of oritatami systems for simulating arbitrary finite automata
This page was built for publication: A general architecture of oritatami systems for simulating arbitrary finite automata