 | Up a level |
Han, Yo-Sub and Ko, Sang-Ki
(2017)
Alignment Distance of Regular Tree Languages.
.
Han, Yo-Sub, Ko, Sang-Ki, Ng, Timothy and Salomaa, Kai
(2017)
Consensus String Problem for Multiple Regular Languages.
.
Han, Yo-Sub and Ko, Sang-Ki
(2017)
Edit-Distance Between Visibly Pushdown Languages.
.
Ko, Sang-Ki, Lee, Ha-Rim and Han, Yo-Sub
(2016)
State Complexity of Regular Tree Languages for Tree Matching.
International Journal of Foundations of Computer Science, 27 (08).
pp. 965-979.
Cho, Da-Jung, Goč, Daniel 
ORCID: 0000-0002-8265-4918, Han, Yo-Sub, Ko, Sang-Ki, Palioudakis, Alexandros ORCID: 0000-0003-3181-6072 and Salomaa, Kai
(2017)
State complexity of permutation on finite languages over a binary alphabet.
Theoretical Computer Science, 682.
pp. 67-78.