Search Results - "Han, Yo-Sub"

On the Decidability of Infix Inclusion Problem.

Authors: Cheon, Hyunjoon Hahn, Joonghyuk Han, Yo-Sub

Source: Theory of Computing Systems; Jun2024, Vol. 68 Issue 3, p301-321, 21p

Characterizations of M-Equivalence and Weak M-Relation.

Authors: Hahn, Joonghyuk Cheon, Hyunjoon Han, Yo-Sub

Source: International Journal of Foundations of Computer Science; Jan2026, Vol. 37 Issue 1, p73-92, 20p

Impossibility of strict assembly of infinite fractals by oritatami.

Authors: Han, Yo-Sub Kim, Hwee

Source: Natural Computing; Dec2021, Vol. 20 Issue 4, p691-701, 11p

Transcript design problem of oritatami systems.

Authors: Han, Yo-Sub Kim, Hwee Seki, Shinnosuke

Source: Natural Computing; Jun2020, Vol. 19 Issue 2, p323-335, 13p

A weak inverse of language neighborhoods and its properties.

Authors: Cheon, Hyunjoon Han, Yo-Sub

Source: Theoretical Computer Science. Feb2026, Vol. 1064, pN.PAG-N.PAG. 1p.

Subjects: Inverse functions, Formal languages

Top-down tree edit-distance of regular tree languages.

Authors: Ko, Sang-Ki Han, Yo-Sub Salomaa, Kai

Source: International Journal of Advances in Engineering Sciences & Applied Mathematics. Mar2019, Vol. 11 Issue 1, p2-10. 9p.

Approximate Cartesian tree pattern matching.

Authors: Kim, Sungmin Han, Yo-Sub

Source: Theoretical Computer Science. Nov2025, Vol. 1056, pN.PAG-N.PAG. 1p.

Subjects: Pattern matching, Polynomial time algorithms, Hamming distance, Cost functions, Matching theory, Data structures, Mathematical convolutions

ARED: automata-based runtime estimation for distributed systems using deep learning.

Authors: Cheon, Hyunjoon Ryu, Jinseung Ryou, Jaecheol et al.

Source: Cluster Computing; Oct2023, Vol. 26 Issue 5, p2629-2641, 13p

Nondeterministic seedless oritatami systems and hardness of testing their equivalence.

Authors: Han, Yo-Sub Kim, Hwee Ota, Makoto et al.

Source: Natural Computing; Mar2018, Vol. 17 Issue 1, p67-79, 13p

Deciding path size of nondeterministic (and input-driven) pushdown automata.

Authors: Han, Yo-Sub Ko, Sang-Ki Salomaa, Kai

Source: Theoretical Computer Science. Jan2023, Vol. 939, p170-181. 12p.

Subjects: Polynomial time algorithms, Finite state machines, Decision making, Robots

EnCur: Curriculum-based in-context learning with structural encoding for code time complexity prediction.

Authors: Hahn, Joonghyuk Aditi Baik, Seung-Yeop et al.

Source: Expert Systems with Applications; Jan2026:Part D, Vol. 296, pN.PAG-N.PAG, 1p

Detecting code paraphrased by large language models using coding style features.

Authors: Park, Shinwoo Jin, Hyundong Cha, Jeong-won et al.

Source: Engineering Applications of Artificial Intelligence; Dec2025:Part B, Vol. 162, pN.PAG-N.PAG, 1p

Left is Better Than Right for Reducing Nondeterminism of NFAs.

Authors: Ko, Sang-Ki Han, Yo-Sub

Source: International Journal of Foundations of Computer Science. Aug2021, Vol. 32 Issue 5, p531-550. 20p.

Subjects: Polynomial time algorithms, Finite state machines, Equivalence classes (Set theory)

Generalizations of Code Languages with Marginal Errors.

Authors: Ko, Sang-Ki Han, Yo-Sub Salomaa, Kai

Source: International Journal of Foundations of Computer Science. Aug2021, Vol. 32 Issue 5, p509-529. 21p.

Subjects: Generalization, Language & languages, Suffixes & prefixes (Grammar), Algorithms, Decision making

Existential and universal width of alternating finite automata.

Authors: Han, Yo-Sub Kim, Sungmin Ko, Sang-Ki et al.

Source: Information & Computation. Sep2025, Vol. 306, pN.PAG-N.PAG. 1p.

Subjects: Decidability (Mathematical logic), Computational complexity, Finite state machines

Pseudo-inversion: closure properties and decidability.

Authors: Cho, Da-Jung Han, Yo-Sub Kang, Shin-Dong et al.

Source: Natural Computing; Mar2016, Vol. 15 Issue 1, p31-39, 9p

State complexity of deletion and bipolar deletion.

Authors: Han, Yo-Sub Ko, Sang-Ki Salomaa, Kai

Source: Acta Informatica; Feb2016, Vol. 53 Issue 1, p67-85, 19p

A Recommendation Model Using the Bandwagon Effect for E-Marketing Purposes in IoT.

Authors: Choi, Sang-Min Lee, Hyein Han, Yo-Sub et al.

Source: International Journal of Distributed Sensor Networks; 7/7/2015, Vol. 2015, p1-7, 7p

A Speculative Parallel DFA Membership Test for Multicore, SIMD and Cloud Computing Environments.

Authors: Ko, Yousun Jung, Minyoung Han, Yo-Sub et al.

Source: International Journal of Parallel Programming; Jun2014, Vol. 42 Issue 3, p456-489, 34p

A general architecture of oritatami systems for simulating arbitrary finite automata.

Authors: Han, Yo-Sub Kim, Hwee Masuda, Yusei et al.

Source: Theoretical Computer Science. May2021, Vol. 870, p29-52. 24p.

Subjects: Finite state machines, Turing machines, Molecular self-assembly, Mathematical models, Robots