• 701 Citations
  • 13 h-Index
20052019
If you made any changes in Pure these will be visible here soon.

Fingerprint Dive into the research topics where Yo-Sub Han is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

Formal languages Engineering & Materials Science
Finite automata Engineering & Materials Science
State Complexity Mathematics
Regular Languages Mathematics
Context free languages Engineering & Materials Science
Strings Mathematics
Finite State Automata Mathematics
Recommender systems Engineering & Materials Science

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2005 2019

A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata

Han, Y. S., Kim, H., Masuda, Y. & Seki, S., 2019 Jan 1, Implementation and Application of Automata - 24th International Conference, CIAA 2019, Proceedings. Hospodár, M. & Jirásková, G. (eds.). Springer Verlag, p. 146-157 12 p. (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

Finite Automata
Finite automata
Turing machines
Turing Machine
Turing

Alignment distance of regular tree languages

Han, Y. S. & Ko, S. K., 2019 Oct 1, In : Theoretical Computer Science. 787, p. 127-137 11 p.

Research output: Contribution to journalArticle

Alignment
Maximum Degree
Bioinformatics
XML
Tree Automata

Bound-decreasing duplication system

Cho, D. J., Han, Y. S. & Kim, H., 2019 Nov 12, In : Theoretical Computer Science. 793, p. 152-168 17 p.

Research output: Contribution to journalArticle

Finite automata
Duplication
Finite State Automata
Strings
Formal languages

Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity

Han, Y. S., Ko, S. K. & Salomaa, K., 2019 Jan 1, Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings. Hospodár, M., Jirásková, G. & Konstantinidis, S. (eds.). Springer Verlag, p. 158-170 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11612 LNCS).

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

Computability and decidability
Pushdown Automata
Treewidth
Nondeterminism
Finite automata

Ruleset optimization on isomorphic oritatami systems

Han, Y. S. & Kim, H., 2019 Sep 20, In : Theoretical Computer Science. 785, p. 128-139 12 p.

Research output: Contribution to journalArticle

Folding
Hardness
Fold
Isomorphic
RNA