In this paper, we propose an architecture of oritatami systems 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(t4 log2 t) steps in order to simulate t steps of a Turing machine. The architecture we propose employs only 329 bead types and requires just O(t|Q|4|Σ|2) steps to simulate an NFA with a state set Q working on a word of length t over an alphabet Σ.
|Title of host publication||Implementation and Application of Automata - 24th International Conference, CIAA 2019, Proceedings|
|Editors||Michal Hospodár, Galina Jirásková|
|Number of pages||12|
|Publication status||Published - 2019|
|Event||24th International Conference on Implementation and Application of Automata, CIAA 2019 - Košice, Slovakia|
Duration: 2019 Jul 22 → 2019 Jul 25
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||24th International Conference on Implementation and Application of Automata, CIAA 2019|
|Period||19/7/22 → 19/7/25|
Bibliographical noteFunding Information:
This work is supported primarily by JSPS-NRF Bilateral Program No. YB29004 to Han and Seki, the Basic Science Research Program (NRF-2018R1D1A1A09084107) to Han, JSPS KAKENHI Grant-in-Aids for Young Scientists (A) No. 16H05854 and for Challenging Research (Exploratory) No. 18K19779 to Seki, and JST Program to Disseminate Tenure Tracking System, MEXT, Japan No. 6F36 to Seki. Kim is also supported by NIH R01GM109459, NSF’s CCF01526485, DMS-1800443, the Southeast Center for Mathematics and Biology, and the NSF-Simons Research Center for Mathematics of Complex Biological Systems (DMS-1764406, 594594).
© 2019, Springer Nature Switzerland AG.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)