발행물

논문
저서
컨퍼런스

전체 논문

125

71

Consensus String Problem for Multiple Regular Languages
Yo-Sub Han, Sang‐Ki Ko, Timothy Ng, Kai Salomaa
Lecture notes in computer science, 2017

72

Alignment Distance of Regular Tree Languages
Yo-Sub Han, Sang‐Ki Ko
Lecture notes in computer science, 2017

73

State Complexity of k-Parallel Tree Concatenation
Yo-Sub Han, Sang‐Ki Ko, Kai Salomaa
Fundamenta Informaticae, 2017

74

State complexity of permutation on finite languages over a binary alphabet
Da-Jung Cho, Daniel Goč, Yo-Sub Han, Sang‐Ki Ko, Alexandros Palioudakis, Kai Salomaa
Theoretical Computer Science, 2017

75

Edit-Distance Between Visibly Pushdown Languages
Yo-Sub Han, Sang‐Ki Ko
Lecture notes in computer science, 2017

76

Matrix Semigroup Freeness Problems in SL $$(2,\mathbb {Z})$$
Sang‐Ki Ko, Igor Potapov
Lecture notes in computer science, 2017

77

Composition problems for braids: Membership, Identity and Freeness
Sang‐Ki Ko, Igor Potapov
arXiv (Cornell University), 2017

78

Vector Ambiguity and Freeness Problems in SL $$(2,\mathbb {Z})$$
Sang‐Ki Ko, Igor Potapov
Lecture notes in computer science, 2017

79

State Complexity of Regular Tree Languages for Tree Matching
Sang‐Ki Ko, Ha-Rim Lee, Yo-Sub Han
International Journal of Foundations of Computer Science, 2016

80

State Complexity of Insertion
Yo-Sub Han, Sang‐Ki Ko, Timothy Ng, Kai Salomaa
International Journal of Foundations of Computer Science, 2016