In this paper, we propose an architecture of oritatami systems, a mathematical model RNA cotranscriptional folding, with which one can simulate arbitrary nondeterministic finite automaton (NFA) in unified manner. The system is known to be Turing-universal but the simulation available so far requires 542 bead types and O ( t 4 log 2 ? ) steps order Turing machine. employs only 337 just | Q ? NFA...