A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata

Yo-Sub Han, Hwee Kim, Yusei Masuda, Shinnosuke Seki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 Σ.

Original languageEnglish
Title of host publicationImplementation and Application of Automata - 24th International Conference, CIAA 2019, Proceedings
EditorsMichal Hospodár, Galina Jirásková
PublisherSpringer Verlag
Pages146-157
Number of pages12
ISBN (Print)9783030236786
DOIs
Publication statusPublished - 2019 Jan 1
Event24th International Conference on Implementation and Application of Automata, CIAA 2019 - Košice, Slovakia
Duration: 2019 Jul 222019 Jul 25

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11601 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th International Conference on Implementation and Application of Automata, CIAA 2019
CountrySlovakia
CityKošice
Period19/7/2219/7/25

Fingerprint

Finite Automata
Finite automata
Turing machines
Turing Machine
Turing
Arbitrary
Simulation
Architecture

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Han, Y-S., Kim, H., Masuda, Y., & Seki, S. (2019). A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata. In M. Hospodár, & G. Jirásková (Eds.), Implementation and Application of Automata - 24th International Conference, CIAA 2019, Proceedings (pp. 146-157). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11601 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-23679-3_12
Han, Yo-Sub ; Kim, Hwee ; Masuda, Yusei ; Seki, Shinnosuke. / A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata. Implementation and Application of Automata - 24th International Conference, CIAA 2019, Proceedings. editor / Michal Hospodár ; Galina Jirásková. Springer Verlag, 2019. pp. 146-157 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{27a5b0f84c3d49c88494a84c9c84d8c8,
title = "A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata",
abstract = "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 Σ.",
author = "Yo-Sub Han and Hwee Kim and Yusei Masuda and Shinnosuke Seki",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-3-030-23679-3_12",
language = "English",
isbn = "9783030236786",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "146--157",
editor = "Michal Hospod{\'a}r and Galina Jir{\'a}skov{\'a}",
booktitle = "Implementation and Application of Automata - 24th International Conference, CIAA 2019, Proceedings",
address = "Germany",

}

Han, Y-S, Kim, H, Masuda, Y & Seki, S 2019, A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata. in M Hospodár & G Jirásková (eds), Implementation and Application of Automata - 24th International Conference, CIAA 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11601 LNCS, Springer Verlag, pp. 146-157, 24th International Conference on Implementation and Application of Automata, CIAA 2019, Košice, Slovakia, 19/7/22. https://doi.org/10.1007/978-3-030-23679-3_12

A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata. / Han, Yo-Sub; Kim, Hwee; Masuda, Yusei; Seki, Shinnosuke.

Implementation and Application of Automata - 24th International Conference, CIAA 2019, Proceedings. ed. / Michal Hospodár; Galina Jirásková. Springer Verlag, 2019. p. 146-157 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11601 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata

AU - Han, Yo-Sub

AU - Kim, Hwee

AU - Masuda, Yusei

AU - Seki, Shinnosuke

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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 Σ.

AB - 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 Σ.

UR - http://www.scopus.com/inward/record.url?scp=85069539793&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85069539793&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-23679-3_12

DO - 10.1007/978-3-030-23679-3_12

M3 - Conference contribution

AN - SCOPUS:85069539793

SN - 9783030236786

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 146

EP - 157

BT - Implementation and Application of Automata - 24th International Conference, CIAA 2019, Proceedings

A2 - Hospodár, Michal

A2 - Jirásková, Galina

PB - Springer Verlag

ER -

Han Y-S, Kim H, Masuda Y, Seki S. A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata. In Hospodár M, Jirásková G, editors, Implementation and Application of Automata - 24th International Conference, CIAA 2019, Proceedings. Springer Verlag. 2019. p. 146-157. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-23679-3_12