In this paper, we propose an architecture of oritatami systems, a mathematical model of RNA cotranscriptional folding, with which one can simulate an arbitrary nondeterministic finite automaton (NFA) in a unified manner. The oritatami system is known to be Turing-universal but the simulation available so far requires 542 bead types and $O(t^4{\log }^{2}t)$ steps in order to simulate t steps of a Turing machine. The architecture we propose employs only 337 bead types and requires just $O(t|Q{|}^4|\mathrm{\Sigma }{|}^2)$ steps to simulate an NFA with a state set Q working on a word of length t over an alphabet Σ.

中文翻译：

---

Oritatami系统的通用体系结构，用于模拟任意有限自动机

在本文中，我们提出了一种oritatami系统的体系结构，一种RNA共转录折叠的数学模型，利用该模型可以统一模拟任意不确定的有限自动机（NFA）。折纸系统已知是图灵通用的，但是到目前为止可用的模拟需要542种珠子类型，并且$Ø（{Ť}^4{\mathrm{日志}}^{\mathrm{2个}}Ť）$步骤以模拟图灵机的t步。我们提出的架构仅采用337种磁珠类型，仅需要$Ø（Ť|问{|}^4|\mathrm{\Sigma }{|}^{\mathrm{2个}}）$步骤，模拟一个状态集为Q的NFA，该状态集作用于字母Σ上长度为t的单词。