Yo-Sub Han, Ph.D.
Affiliations: | 2006 | Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong |
Area:
Computer ScienceGoogle:
"Yo-Sub Han"
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Han Y, Ko S, Ng T, et al. (2020) Closest Substring Problems for Regular Languages Theoretical Computer Science |
| Han Y, Ko SK, Salomaa K. (2017) State Complexity of k-Parallel Tree Concatenation Fundamenta Informaticae. 154: 185-199 |
| Han Y, Salomaa A, Salomaa K. (2017) Ambiguity, nondeterminism and state complexity of finite automata Acta Cybernetica. 23: 141-157 |
| Eom HS, Han YS, Jirásková G. (2016) State Complexity of Basic Operations on Non-Returning Regular Languages Fundamenta Informaticae. 144: 161-182 |
| Ko SK, Lee HR, Han Y. (2016) State Complexity of Regular Tree Languages for Tree Matching International Journal of Foundations of Computer Science. 27: 965-979 |
| Han Y, Ko SK, Ng T, et al. (2016) State complexity of insertion International Journal of Foundations of Computer Science. 27: 863-878 |
| Ko SK, Eom HS, Han Y. (2016) Operational State Complexity of Subtree-Free Regular Tree Languages International Journal of Foundations of Computer Science. 27: 705-724 |
| Cho DJ, Han YS, Ng T, et al. (2016) Outfix-guided insertion Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9840: 102-113 |
| Ko SK, Han YS, Salomaa K. (2016) Approximate matching between a context-free grammar and a finite-state automaton Information and Computation. 247: 278-298 |
| Han YS, Ko SK, Salomaa K. (2016) State complexity of deletion and bipolar deletion Acta Informatica. 53: 67-85 |