Works matching AU Han, Yo-Sub

Results: 20

Impossibility of strict assembly of infinite fractals by oritatami.

Published in:

Natural Computing, 2021, v. 20, n. 4, p. 691, doi. 10.1007/s11047-021-09868-w

By:

Han, Yo-Sub;
Kim, Hwee

Publication type:

Article

Transcript design problem of oritatami systems.

Published in:

Natural Computing, 2020, v. 19, n. 2, p. 323, doi. 10.1007/s11047-019-09776-0

By:

Han, Yo-Sub;
Kim, Hwee;
Seki, Shinnosuke

Publication type:

Article

Nondeterministic seedless oritatami systems and hardness of testing their equivalence.

Published in:

Natural Computing, 2018, v. 17, n. 1, p. 67, doi. 10.1007/s11047-017-9661-y

By:

Han, Yo-Sub;
Kim, Hwee;
Ota, Makoto;
Seki, Shinnosuke

Publication type:

Article

Pseudo-inversion: closure properties and decidability.

Published in:

Natural Computing, 2016, v. 15, n. 1, p. 31, doi. 10.1007/s11047-015-9502-9

By:

Cho, Da-Jung;
Han, Yo-Sub;
Kang, Shin-Dong;
Kim, Hwee;
Ko, Sang-Ki;
Salomaa, Kai

Publication type:

Article

State complexity of deletion and bipolar deletion.

Published in:

Acta Informatica, 2016, v. 53, n. 1, p. 67, doi. 10.1007/s00236-015-0245-y

By:

Han, Yo-Sub;
Ko, Sang-Ki;
Salomaa, Kai

Publication type:

Article

Left is Better Than Right for Reducing Nondeterminism of NFAs.

Published in:

International Journal of Foundations of Computer Science, 2021, v. 32, n. 5, p. 531, doi. 10.1142/S0129054121410069

By:

Ko, Sang-Ki;
Han, Yo-Sub

Publication type:

Article

Generalizations of Code Languages with Marginal Errors.

Published in:

International Journal of Foundations of Computer Science, 2021, v. 32, n. 5, p. 509, doi. 10.1142/S0129054121410057

By:

Ko, Sang-Ki;
Han, Yo-Sub;
Salomaa, Kai

Publication type:

Article

Self-Attraction Removal from Oritatami Systems.

Published in:

International Journal of Foundations of Computer Science, 2019, v. 30, n. 6/7, p. 1047, doi. 10.1142/S0129054119400288

By:

Han, Yo-Sub;
Kim, Hwee;
Rogers, Trent A.;
Seki, Shinnosuke

Publication type:

Article

Preface.

Published in:

International Journal of Foundations of Computer Science, 2017, v. 28, n. 5, p. 437, doi. 10.1142/S0129054117020014

By:

Han, Yo-Sub;
Salomaa, Kai

Publication type:

Article

State Complexity of Regular Tree Languages for Tree Matching.

Published in:

International Journal of Foundations of Computer Science, 2016, v. 27, n. 8, p. 965, doi. 10.1142/S0129054116500398

By:

Ko, Sang-Ki;
Lee, Ha-Rim;
Han, Yo-Sub

Publication type:

Article

Operational State Complexity of Subtree-Free Regular Tree Languages.

Published in:

International Journal of Foundations of Computer Science, 2016, v. 27, n. 6, p. 705, doi. 10.1142/S0129054116500246

By:

Ko, Sang-Ki;
Eom, Hae-Sung;
Han, Yo-Sub

Publication type:

Article

State Complexity of Insertion.

Published in:

International Journal of Foundations of Computer Science, 2016, v. 27, n. 7, p. 863, doi. 10.1142/S0129054116500349

By:

Han, Yo-Sub;
Ko, Sang-Ki;
Ng, Timothy;
Salomaa, Kai

Publication type:

Article

State Complexity of Boundary of Prefix-Free Regular Languages.

Published in:

International Journal of Foundations of Computer Science, 2015, v. 26, n. 6, p. 697, doi. 10.1142/S0129054115500392

By:

Eom, Hae-Sung;
Han, Yo-Sub

Publication type:

Article

State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages.

Published in:

International Journal of Foundations of Computer Science, 2015, v. 26, n. 2, p. 211, doi. 10.1142/s0129054115500124

By:

Eom, Hae-Sung;
Han, Yo-Sub;
Salomaa, Kai

Publication type:

Article

THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE.

Published in:

International Journal of Foundations of Computer Science, 2013, v. 24, n. 7, p. 1067, doi. 10.1142/S0129054113400315

By:

HAN, YO-SUB;
KO, SANG-KI;
SALOMAA, KAI

Publication type:

Article

OVERLAP-FREE LANGUAGES AND SOLID CODES.

Published in:

International Journal of Foundations of Computer Science, 2011, v. 22, n. 5, p. 1197, doi. 10.1142/S0129054111008647

By:

HAN, YO-SUB;
SALOMAA, KAI;
Yu, Sheng

Publication type:

Article

STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES.

Published in:

International Journal of Foundations of Computer Science, 2008, v. 19, n. 3, p. 581, doi. 10.1142/S0129054108005838

By:

HAN, YO-SUB;
SALOMAA, KAI

Publication type:

Article

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

Published in:

International Journal of Distributed Sensor Networks, 2015, v. 2015, p. 1, doi. 10.1155/2015/475163

By:

Choi, Sang-Min;
Lee, Hyein;
Han, Yo-Sub;
Man, Ka Lok;
Chong, Woon Kian

Publication type:

Article

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

Published in:

International Journal of Parallel Programming, 2014, v. 42, n. 3, p. 456, doi. 10.1007/s10766-013-0258-5

By:

Ko, Yousun;
Jung, Minyoung;
Han, Yo-Sub;
Burgstaller, Bernd

Publication type:

Article

On the Decidability of Infix Inclusion Problem.

Published in:

Theory of Computing Systems, 2024, v. 68, n. 3, p. 301, doi. 10.1007/s00224-023-10160-w

By:

Cheon, Hyunjoon;
Hahn, Joonghyuk;
Han, Yo-Sub

Publication type:

Article