발행물

논문
저서
컨퍼런스

전체 논문

125

81

Operational State Complexity of Subtree-Free Regular Tree Languages
Sang‐Ki Ko, Hae-Sung Eom, Yo-Sub Han
International Journal of Foundations of Computer Science, 2016

82

Approximate matching between a context-free grammar and a finite-state automaton
Sang‐Ki Ko, Yo-Sub Han, Kai Salomaa
Information and Computation, 2016

83

Inferring a Relax NG Schema from XML Documents
Guen-Hae Kim, Sang‐Ki Ko, Yo-Sub Han
Lecture notes in computer science, 2016

84

Matrix Semigroup Freeness Problems in SL(2, Z)
Sang‐Ki Ko, Igor Potapov
arXiv (Cornell University), 2016

85

Matrix Semigroup Freeness Problems in $\mathrm{SL}(2,\mathbb{Z})$
Sang‐Ki Ko, Igor Potapov
arXiv (Cornell University), 2016

86

Pseudo-inversion: closure properties and decidability
Da-Jung Cho, Yo-Sub Han, Shindong Kang, Hwee Kim, Sang‐Ki Ko, Kai Salomaa
Natural Computing, 2015

87

State complexity of deletion and bipolar deletion
Yo-Sub Han, Sang‐Ki Ko, Kai Salomaa
Acta Informatica, 2015

88

State Complexity of Kleene-Star Operations on Regular Tree Languages
Yo-Sub Han, Sang‐Ki Ko, Xiaoxue Piao, Kai Salomaa
Acta Cybernetica, 2015

89

The State Complexity of Permutations on Finite Languages over Binary Alphabets
Alexandros Palioudakis, Da-Jung Cho, Daniel Goč, Yo-Sub Han, Sang‐Ki Ko, Kai Salomaa
Lecture notes in computer science, 2015

90

State complexity of inversion operations
Da-Jung Cho, Yo-Sub Han, Sang‐Ki Ko, Kai Salomaa
Theoretical Computer Science, 2015