→ Journal ⟶ Conf ⟶ Book Chapters ⟶ GitHub →

Journals

  1. Pattern mining under Simon’s congruence
    Sungmin Kim and Yo-Sub Han
    To appear in Information and Computation (I&C) [link]

  2. A Weak Inverse of Language Neighborhoods and Its Properties
    Hyunjoon Cheon and Yo-Sub Han
    In Theoretical Computer Science (TCS), Vol. 1064, 115704, February 2026 [link]

  3. EnCur: Curriculum-Based In-Context Learning with Structural Encoding for Code Time Complexity Prediction
    Joonghyuk Hahn, Aditi, SeungYeop Baik, Shinwoo Park, Sang-Ki Ko and Yo-Sub Han
    In Expert Systems with Applications, Vol. 296, 129094, January 2026 [link]

  4. Characterizations of M-equivalence and weak M-relation
    Joonghyuk Hahn, Hyunjoon Cheon and Yo-Sub Han
    In International Journal of Foundations of Computer Science (IJFCS), 73--92, Janunary 2026 [link]

  5. Detecting Code Paraphrased by Large Language Models using Coding Style Features
    Shinwoo Park, Hyundong Jin, Jeong-won Cha and Yo-Sub Han
    In Engineering Applications of Artificial Intelligence, Vol. 162, December 2025 [link]

  6. Approximate Cartesian Tree Pattern Matching
    Sungmin Kim and Yo-Sub Han
    In Theoretical Computer Science (TCS), Vol. 1056, 115506, November 2025 [link]

  7. Existential and Universal Width of Alternating Finite Automata
    Yo-Sub Han, Sungmin Kim, Sang-Ki Ko and Kai Salomaa
    In Information and Computation (I&C), Vol. 306, 105337, September 2025 [link]

  8. Advanced Code Time Complexity Prediction Approach Using Contrastive Learning
    Shinwoo Park, Joonghyuk Hahn, Elizabeth Orwig, Sang-Ki Ko and Yo-Sub Han
    In Engineering Applications of Artificial Intelligence, Vol. 151, 110631, July 2025 [link]

  9. On the Decidability of Infix Inclusion Problem
    Hyunjoon Cheon, Joonghyuk Hahn and Yo-Sub Han
    In Theory of Computing Systems, Vol. 68, 301--321, June 2024 [link]

  10. Simon's Congruence Pattern Matching
    Sungmin Kim, Sang-Ki Ko and Yo-Sub Han
    In Theoretical Computer Science (TCS), Vol. 994, 114478, May 2024 [link]

  11. ARED: Automata-based Runtime Estimation for Distributed Systems using Deep Learning
    Hyunjoon Cheon, Jinseung Ryu, Jaecheol Ryou, Chan Yeol Park and Yo-Sub Han
    In Cluster Computing, Vol. 26, 2429--2641, Oct. 2023 [link]

  12. On Simon's Congruence Closure of a String
    Sungmin Kim, Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Theoretical Computer Science (TCS), Vol. 972, 114078, Sep. 2023 [link]

  13. An Empirical Study on Multimodal Activity Clustering of Android Applications
    Sungmin Choi, Hyeon-Tae Seo and Yo-Sub Han
    In IEEE Access, Vol. 11, 53598--53614, Jun. 2023 [link]

  14. Deciding path size of nondeterministic (and input-driven) pushdown automata
    Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Theoretical Computer Science (TCS), Vol. 939, 170--181, Jan. 2023 [link]

  15. Impossibility of Strict Assembly of Infinite Fractals by Oritatami
    Yo-Sub Han and Hwee Kim
    In Natural Computing, Vol 20, No. 4, 691--701, December 2021 [link]

  16. Left is Better Than Right for Reducing Nondeterminism of NFAs
    Sang-Ki Ko and Yo-Sub Han
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 32, No. 5, 531--550, August 2021 [link]

  17. Generalizations of Code Languages with Marginal Errors
    Sang-Ki Ko, Yo-Sub Han and Kai Salomaa
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 32, No. 5, 509--529, August 2021 [link]

  18. Consensus String Problem for Multiple Regular Languages
    Yo-Sub Han, Sang-Ki Ko, Timothy Ng and Kai Salomaa
    In Information and Computation (I&C), Vol. 279, August 2021 [link]

  19. A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata
    Yo-Sub Han, Hwee Kim, Yusei Masuda and Shinnosuke Seki
    In Theoretical Computer Science (TCS), Vol. 870, 29--52, May 2021 [link]

  20. Closest Substring Problems for Regular Languages
    Yo-Sub Han, Sang-Ki Ko, Timothy Ng and Kai Salomaa
    In Theoretical Computer Science (TCS), Vol. 862, 144--154, March 2021 [link]

  21. Transcript Design Problem of Oritatami Systems
    Yo-Sub Han, Hwee Kim and Shinnosuke Seki
    In Natural Computing, Vol. 19, 323--335, June 2020

  22. Site-directed Insertion: Language Equations and Decision Problems
    Da-Jung Cho, Yo-Sub Han, Kai Salomaa and Taylor Smith
    In Theoretical Computer Science (TCS), Vol. 798, 40--51, December 2019

  23. Bound-Decreasing Duplication System
    Da-Jung Cho, Yo-Sub Han and Hwee Kim
    In Theoretical Computer Science (TCS), Vol. 793, 152--168, November 2019

  24. Alignment Distance of Regular Tree Languages
    Yo-Sub Han and Sang-Ki Ko
    In Theoretical Computer Science (TCS), Vol. 787, 127--137, October 2019

  25. Self-attraction Removal from Oritatami Systems
    Yo-Sub Han, Hwee Kim, Trent Rogers and Shinnosuke Seki
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 30, No. 6&7, 1047--1067, September 2019

  26. Ruleset Optimization on Isomorphic Oritatami Systems
    Yo-Sub Han and Hwee Kim
    In Theoretical Computer Science (TCS), Vol. 785, 128--139, September 2019

  27. An abusive text detection system based on enhanced abusive and non-abusive word lists
    Ho-Suk Lee, Hong-Rae Lee, Jun-U Park and Yo-Sub Han
    In Decision Support Systems, Vol. 113, 22--31, September 2018

  28. Growth Rate of Minimum Branching
    Alexandros Palioudakis, Yo-Sub Han and Kai Salomaa
    In Journal of Automata, Languages and Combinatorics (JALC), Vol. 23(1-3), 281--292, April 2018

  29. Nondeterministic seedless oritatami systems and hardness of testing their equivalence
    Yo-Sub Han, Hwee Kim, Makoto Ota and Shinnosuke Seki
    In Natural Computing, Vol. 17, 67--79, Mar. 2018 [pdf]

  30. Outfix-Guided Insertion
    Da-Jung Cho, Yo-Sub Han, Timothy Ng and Kai Salomaa
    In Theoretical Computer Science (TCS), Vol. 701, 70--84, Nov. 2017 [pdf]

  31. Pseudoknot-Generating Operation
    Da-Jung Cho, Yo-Sub Han, Timothy Ng and Kai Salomaa
    In Theoretical Computer Science (TCS), Vol. 695, 52--64, Oct. 2017 [pdf]

  32. State Complexity of k-Parallel Tree Concatenation
    Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Fundamenta Informaticae (FI), Vol. 154, 185--199, August 2017 [pdf]

  33. State Complexity of Permutation on Finite Languages over a Binary Alphabet
    Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, Alexandros Palioudakis and Kai Salomaa
    In Theoretical Computer Science (TCS), Vol. 682, 67--78, June 2017 [pdf]

  34. Ambiguity, Nondeterminism and State Complexity of Finite Automata
    Yo-Sub Han, Arto Salomaa and Kai Salomaa
    In Acta Cybernetica Vol. 23(2), 141--157, May 2017 [pdf]

  35. Complexity of Regular Tree Languages for Tree Matching
    Sang-Ki Ko, Ha-Rim Lee and Yo-Sub Han
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 27, No. 8 965--979, December 2016 [pdf]

  36. State Complexity of Insertion
    Yo-Sub Han, Sang-Ki Ko, Timothy Ng and Kai Salomaa
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 27, No. 7 863--878, November 2016 [pdf]

  37. Operational State Complexity of Subtree-Free Regular Tree Languages
    Sang-Ki Ko, Hae-Sung Eom and Yo-Sub Han
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 27, No. 6 705--724, September 2016 [pdf]

  38. Duplications and Pseudo-Duplications
    Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa
    In International Journal of Unconventional Computing (IJUC), Vol. 12(2-3), 145--167, May 2016

  39. OMPPM: Online Multiple Palindrome Pattern Matching
    Hwee Kim and Yo-Sub Han
    In Bioinformatics, Vol. 32(8), 1151--1157, April 2016 [pdf]

  40. Approximate Matching between a Context-Free Grammar and a Finite-State Automaton
    Sang-Ki Ko, Yo-Sub Han and Kai Salomaa
    In Information and Computation (I&C), Vol. 247, 278--289, April 2016 [pdf]

  41. State Complexity of Basic Operations on Non-Returning Regular Languages
    Hae-Sung Eom, Yo-Sub Han and Galina Jirásková
    In Fundamenta Informaticae (FI), Vol. 144(2), 161--182, March 2016 [pdf]

  42. Pseudo-Inversion: Closure Properties and Decidability
    Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko and Kai Salomaa
    In Natural Computing, Vol. 15, 31--39, March 2016 [pdf]

  43. State Complexity of Deletion and Bipolar Deletion
    Yo-Sub Han, Sang-Ki Ko, Kai Salomaa
    In Acta Informatica, Vol. 53, 67--85, February 2016 [pdf]

  44. State Complexity of Inversion Operations
    Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Theoretical Computer Science (TCS), Vol. 610, 2--12, January 2016 [pdf]

  45. State complexity of Kleene-star operations on regular tree languages
    Yo-Sub Han, Sang-Ki Ko, Xiaoxue Piao and Kai Salomaa
    In Acta Cybernetica Vol. 22(2), 403--422, November 2015 [pdf]

  46. State Complexity of Boundary of Prefix-Free Regular Languages
    Hae-Sung Eom and Yo-Sub Han
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 26, No. 6 697--707, September 2015 [pdf]

  47. Non-overlapping Inversion on Strings and Languages
    Hwee Kim and Yo-Sub Han
    In Theoretical Computer Science (TCS), Vol. 592, 9--22, August 2015 [pdf]

  48. A Recommendation Model Using the Bandwagon Effect for E-Marketing Purposes in IoT
    Sang-Min Choi, Hyein Lee, Yo-Sub Han, Ka Lok Man and Woon Kian Chong
    In International Journal of Distributed Sensor Networks, Vol. 2015, July 2015 [pdf]

  49. Alignment with Non-Overlapping Inversions and Translocations on Two Strings
    Da-Jung Cho, Yo-Sub Han and Hwee Kim
    In Theoretical Computer Science (TCS), Vol. 575, 90--101, April 2015 [pdf]

  50. State complexity of k-union and k-intersection for prefix-free regular languages
    Hae-Sung Eom, Yo-Sub Han and Kai Salomaa
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 26, No. 2 211--227, February 2015 [pdf]

  51. Decidability of Involution Hypercodes
    Da-Jung Cho, Yo-Sub Han and Sang-Ki Ko
    In Theoretical Computer Science (TCS), Vol. 550, 90--99, September 2014 [pdf]

  52. A Speculative Parallel DFA Membership Test for Multicore, SIMD and Cloud Computing Environments
    Yousun Ko, Minyoung Jung, Yo-Sub Han and Bernd Burgstaller
    In International Journal of Parallel Programming (IJPP), Vol. 42, 456---489, June 2014 [pdf]

  53. The Edit-Distance between a Regular Language and a Context-Free Language
    Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 24, No. 7 1067--1082, November 2013 [pdf]

  54. State Elimination Heuristics for Short Regular Expressions
    Yo-Sub Han
    In Fundamenta Informaticae (FI), Vol. 128(4), 445--462, November 2013 [pdf]

  55. State Complexity of Combined Operations for Suffix-Free Regular Languages
    Hae-Sung Eom and Yo-Sub Han
    In Theoretical Computer Science (TCS), Vol. 510, 87--93, October 2013 [pdf]

  56. An Improved Prefix-Free Regular-Expression Matching
    Yo-Sub Han
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 24, No. 5, 679--685, August 2013 [pdf]

  57. Representative Reviewers for Internet Social Media
    Sang-Min Choi and Yo-Sub Han
    In Expert Systems with Applications, Vol. 40, 1274--1282, March 2013 [pdf]

  58. Analysis of a cellular automaton model for car traffic with a junction
    Yo-Sub Han and Sang-Ki Ko
    In Theoretical Computer Science (TCS), Vol. 450, 54--67, September 2012 [pdf]

  59. A Movie Recommendation Algorithm based on Genre Correlations
    Sang-Min Choi, Sang-Ki Ko and Yo-Sub Han
    In Expert Systems with Applications, Vol. 39, 8079--8085, July 2012 [pdf]

  60. Computing User Reputation in a Social Network of Web 2.0
    Yo-Sub Han, Laehyun Kim and Jeong-Won Cha
    In Computing and Informatics, Vol. 31, No. 2, 447--462, 2012 [pdf]

  61. Overlap-Free Languages and Solid Codes
    Yo-Sub Han and Kai Salomaa
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 22, No. 5, 1197--1209, August 2011 [pdf]

  62. Ranking Parameters based on Social Network for User-generated Video Contents
    Laehyun Kim, Lisa Wiyartanti, Hyunchul Cho, Yo-Sub Han and Jeong-Won Cha
    In Information-An International Interdisciplinary Journal, Vol. 13, No. 5, 1667--1678, September 2010 [pdf]

  63. On the Linear Number of Matching Substrings
    Yo-Sub Han
    In Journal of Universal Computer Science, Vol. 16, 715--728, March 2010 [pdf]

  64. Nondeterministic State Complexity of Nested Word Automata
    Yo-Sub Han and Kai Salomaa
    In Theoretical Computer Science (TCS), Vol. 410, 2961--2971, August 2009 [pdf]

  65. State Complexity of Basic Operations on Suffix-Free Regular Languages
    Yo-Sub Han and Kai Salomaa
    In Theoretical Computer Science (TCS), Vol. 410, 2537--2548, June 2009 [pdf]

  66. Nondeterministic State Complexity of Basic Operations for Prefix-free Regular Languages
    Yo-Sub Han, Kai Salomaa and Derick Wood
    In Fundamenta Informaticae (FI), Vol. 90(1-2), 93--106, 2009 [pdf]

  67. Adaptability in an agent-based virtual organisation
    Grzegorz Frackowiak, Maria Ganzha, Maciej Gawinecki, Marcin Paprzycki, Michal Szymczak, Costin Badica, Yo-Sub Han and Myon-Woong Park
    In International Journal of Agent-Oriented Software Engineering (IJAOSE), Vol. No. 2/3, 188--211, 2009 [pdf]

  68. Generalizations of One-Deterministic Regular Languages
    Yo-Sub Han and Derick Wood
    In Information and Computation (I&C), Vol. 206, 1117--1125, 2008 [pdf]

  69. State Complexity of Union and Intersection of Finite Languages
    Yo-Sub Han and Kai Salomaa
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 19, No. 3, 581--595, 2008 [pdf]

  70. Simple-Regular Expressions and Languages
    Yo-Sub Han, Gerhard Trippen and Derick Wood
    In Journal of Automata, Languages and Combinatorics (JALC), Vol. 12(1/2),181--194, 2007 [pdf]

  71. Outfix-free Regular Languages and Prime Outfix-free Decomposition
    Yo-Sub Han and Derick Wood
    In Fundamenta Informaticae (FI), Vol. 81(4), 441--457, 2007 [pdf]

  72. Prefix-Free Regular Languages and Pattern Matching
    Yo-Sub Han, Yajun Wang and Derick Wood
    In Theoretical Computer Science (TCS), Vol. 389, 307--317, 2007 [pdf]

  73. On the Existence of Prime Decompositions
    Yo-Sub Han, Arto Salomaa, Kai Salomaa, Derick Wood and Sheng Yu
    In Theoretical Computer Science (TCS), Vol. 376, 60--69, 2007 [pdf]

  74. Obtaining Shorter Regular Expressions from Finite-State Automata
    Yo-Sub Han and Derick Wood
    In Theoretical Computer Science (TCS), Vol. 370, 110--120, 2007 [pdf]

  75. Intercode Regular Languages
    Yo-Sub Han, Kai Salomaa and Derick Wood
    In Fundamenta Informaticae (FI), Vol. 76, 113--128, 2007 [pdf]

  76. Infix-free Regular Expressions and Languages
    Yo-Sub Han, Yajun Wang and Derick Wood
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 17, No.2, 379--393, 2006 [pdf]

  77. The Generalization of Generalized Automata: Expression Automata
    Yo-Sub Han and Derick Wood
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 16, No. 3, 499--510, 2005 [pdf]

Conferences

  1. Linguistics-Aware Non-Distortionary LLM Watermarking
    Shinwoo Park, Hyejin Park, Hyeseon An and Yo-Sub Han
    To appear in Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing (EMNLP 2026), 2026 [요약]

  2. Steering Language Models Before They Speak: Logit-Level Interventions
    Hyeseon An, Shinwoo Park, Hyundong Jin and Yo-Sub Han
    To appear in Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing (EMNLP 2026), 2026 [요약]

  3. ReSyn: A Generalized Recursive Regular Expression Synthesis Framework
    Seongmin Kim, Hyunjoon Cheon, Su-Hyeon Kim, Yo-Sub Han and Sang-Ki Ko
    To appear in Proceedings of the 35th International Joint Conference on Artificial Intelligence (IJCAI 2026)

  4. Decomposing regular languages under shuffle along trajectories
    Sungmin Kim, Hyunki Hong, Taeryung Lim, Yo-Sub Han and Kai Salomaa
    In Proceedings of the 30th International Conference on Implementation and Application of Automata (CIAA'26), LNCS 16695, 92--107, 2026 [link]

  5. Pattern matching under R-congruence
    Sungmin Kim, Hyundong Jin and Yo-Sub Han
    In Proceedings of the 30th International Conference on Implementation and Application of Automata (CIAA'26), LNCS 16695, 108--123, 2026 [link]

  6. A Linguistics-Aware LLM Watermarking via Syntactic Predictability
    Shinwoo Park, Hyejin Park, Hyeseon An and Yo-Sub Han
    In Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (ACL 2026) 45629--45647, 2026 [pdf] [요약]

  7. RV-HATE: Reinforced Multi-Module Voting for Implicit Hate Speech Detection
    Yejin Lee, Hyeseon An and Yo-Sub Han
    In Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (ACL 2026) 45364--45383, 2026 [pdf] [요약]

  8. ContractEval: A Benchmark for Evaluating Contract-Satisfying Assertions in Code Generation
    Soohan Lim, Joonghyuk Hahn, Hyunwoo Park, Sang-Ki Ko and Yo-Sub Han
    In Findings of the 64th Annual Meeting of the Association for Computational Linguistics (ACL-Findings 2026) 42549--42566, 2026 [pdf] [요약]

  9. A Regex Minimization Benchmark: A PSPACE-Complete Challenge for Language Models
    Hyundong Jin, Joonghyuk Hahn and Yo-Sub Han
    In Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2026), 8020--8048, 2026 [pdf]

  10. Repairing Regex Vulnerabilities via Localization-Guided Instructions
    Sicheol Sung, Joonghyuk Hahn and Yo-Sub Han
    In Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2026), 8128--8142, 2026 [pdf] [요약]

  11. DITTO: A Spoofing Attack Framework on Watermarked LLMs via Knowledge Distillation
    Hyeseon Ahn, Shinwoo Park, Suyeon Woo and Yo-Sub Han
    In Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2026), 4922--4936, 2026 [pdf] [요약]

  12. Query4Regex: Verifiable Regex Transformation through Formal Operations from NL and DSL Queries
    Joonghyuk Hahn and Yo-Sub Han
    In Findings of the 19th Conference of the European Chapter of the Association for Computational Linguistics (EACL-Findings 2026), 6297--6305, 2026 [pdf]

  13. Marking Code Without Breaking It: Code Watermarking for Detecting LLM-Generated Code
    Jungin Kim, Shinwoo Park and Yo-Sub Han
    In Findings of the 19th Conference of the European Chapter of the Association for Computational Linguistics (EACL-Findings 2026), 3990--4002, 2026 [pdf] [요약]

  14. WaterMod: Modular Token-Rank Partitioning for Probability-Balanced LLM Watermarking
    Shinwoo Park, Hyejin Park, Hyeseon Ahn and Yo-Sub Han
    In Proceedings of the 40th AAAI Conference on Artificial Intelligence (AAAI-26), 32683--32691, 2026 [pdf] [요약]

  15. AmpleHate: Amplifying the Attention for Versatile Implicit Hate Detection
    Yejin Lee, Joonghyuk Hahn, Hyeseon Ahn and Yo-Sub Han
    In Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing (EMNLP 2025), 28850--28862, 2025 [pdf] [요약]

  16. Mondrian: A Framework for Logical Abstract (Re)Structuring
    Elizabeth Grace Orwig, Shinwoo Park, Hyundong Jin and Yo-Sub Han
    In Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing (EMNLP 2025), 33663--33678, 2025 [pdf]

  17. TrapDoc: Deceiving LLM Users by Injecting Imperceptible Phantom Tokens into Documents
    Hyundong Jin, Sicheol Sung, Shinwoo Park, SeungYeop Baik and Yo-Sub Han
    In Findings of the 2025 Conference on Empirical Methods in Natural Language Processing (EMNLP-Findings 2025), 18881--18897, 2025 [pdf] [요약]

  18. CodeComplex: Dataset for Worst-Case Time Complexity Prediction
    SeungYeop Baik, Joonghyuk Hahn, Jungin Kim, Aditi, Mingi Jeon, Yo-Sub Han and Sang-Ki Ko
    In Findings of the 2025 Conference on Empirical Methods in Natural Language Processing (EMNLP-Findings 2025), 19616--19638, 2025 [pdf] [요약]

  19. Pattern Mining under Simon's Congruence
    Sungmin Kim and Yo-Sub Han
    In Proceedings of the 29th International Conference on Developments in Language Theory (DLT'25), LNCS 16036, 182--196, 2025 [link]

  20. LogiCase: Effective Test Case Generation from Logical Description in Competitive Programming
    Sicheol Sung, Aditi, Dogyu Kim, Yo-Sub Han and Sang-Ki Ko
    In Proceedings of the 34th International Joint Conference on Artificial Intelligence (IJCAI 2025), 7742--7750, 2025 [pdf]

  21. KatFishNet: Detecting LLM-Generated Korean Text through Linguistic Feature Analysis
    Shinwoo Park, Shubin Kim, Do-Kyung Kim and Yo-Sub Han
    In Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (ACL 2025), 21189--21222, 2025 [pdf] [요약]

  22. TCProF: Time-Complexity Prediction SSL Framework
    Joonghyuk Hahn, Hyeseon Ahn, Jungin Kim, Soohan Lim and Yo-Sub Han
    In Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics (NAACL 2025), 9517--9542, 2025 [pdf] [요약]

  23. Impact of Large Language Models of Code on Fault Localization
    Suhwan Ji, Sanghwa Lee, Changsup Lee, Yo-Sub Han and Hyeonseung Im
    In Proceedings of the 2025 IEEE Conference on Software Testing, Verification and Validation (ICST 2025), 302--313, 2025 [pdf]

  24. Analyzing Offensive Language Dataset Insights from Training Dynamics and Human Agreement Level
    Do-Kyung Kim, Hyeseon Ahn, Youngwook Kim and Yo-Sub Han
    In Proceedings of the 31st International Conference on Computational Linguistics (COLING 2025), 9780--9792, 2025 [pdf] [요약]

  25. Benchmarking Regular Expression Matching
    Alexander Roodt, Brendan Watling, Willem Bester, Brink van der Merwe, Sicheol Sung and Yo-Sub Han
    In Proceedings of the 28th International Conference on Implementation and Application of Automata (CIAA'24), LNCS 15015, 361--331, 2024 [link]

  26. Universal Rewriting Rules for the Parikh Matrix Injectivity Problem
    Ingyu Baek, Joonghyuk Hahn, Yo-Sub Han and Kai Salomaa
    In Proceedings of the 28th International Conference on Developments in Language Theory (DLT'24), LNCS 14791, 68--81, 2024 [link]

  27. Approximate Cartesian Tree Pattern Matching
    Sungmin Kim and Yo-Sub Han
    In Proceedings of the 28th International Conference on Developments in Language Theory (DLT'24), LNCS 14791, 189--202, 2024 [link]

  28. SharedCon: Implicit Hate Speech Detection using Shared Semantics
    Hyeseon Ahn, Youngwook Kim, Jungin Kim, Yo-Sub Han
    In Findings of the Association for Computational Linguistics, ACL 2024 (ACL-Findings 2024), 10444--10455, 2024 [pdf]

  29. SuperST: Superficial Self-Training for Few-Shot Text Classification
    Ju-Hyoung Lee, Joonghyuk Hahn, Hyeon-Tae Seo, Jiho Park and Yo-Sub Han
    In Proceedings of the 2024 Joint International Conference on Computational Linguistics, Language Resources and Evaluation (LREC-COLING 2024), 15436--15447, 2024 [pdf]

  30. ATHENA: Mathematical Reasoning with Thought Expansion
    JB. Kim, Hazel Kim, Joonghyuk Hahn and Yo-Sub Han
    In Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing (EMNLP 2023), 16315--16327, 2023 [pdf]

  31. ConPrompt: Pre-training a Language Model with Machine-Generated Data for Implicit Hate Speech Detection
    Youngwook Kim, Shinwoo Park, Youngsoo Namgoong and Yo-Sub Han
    In Findings of the 2023 Conference on Empirical Methods in Natural Language Processing (EMNLP-Findings 2023), 10964--10980, 2023 [pdf]

  32. GDA: Grammar-based Data Augmentation for Text Classification using Slot Information
    Joonghyuk Hahn, Hyunjoon Cheon, Elizabeth Grace Orwig, Su-Hyeon Kim, Sang-Ki Ko and Yo-Sub Han
    In Findings of the 2023 Conference on Empirical Methods in Natural Language Processing (EMNLP-Findings 2023), 7291--7306, 2023 [pdf]

  33. M-equivalence of Parikh Matrix over a Ternary Alphabet
    Joonghyuk Hahn, Hyunjoon Cheon and Yo-Sub Han
    In Proceedings of the 27th International Conference on Implementation and Application of Automata (CIAA'23), LNCS 14151, 141--152, 2023
    *Note: the conference version contains a minor bug and this [PDF] is a corrected version.

  34. Smaller Representation of Compiled Regular Expressions
    Sicheol Sung, Sang-Ki Ko and Yo-Sub Han
    In Proceedings of the 27th International Conference on Implementation and Application of Automata (CIAA'23), LNCS 14151, 290--301, 2023 [link]

  35. Existential and Universal Width of Alternating Finite Automata
    Yo-Sub Han, Sungmin Kim, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 25th International Conference on Descriptional Complexity of Formal Systems (DCFS'23), LNCS 13918, 51--64, 2023 [link]

  36. On the Simon's Congruence Neighborhood of Languages
    Sungmin Kim, Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 27th International Conference on Developments in Language Theory (DLT'23), LNCS 13911, 168-181, 2023 [link]

  37. Weak Inverse Neighborhood of Languages
    Hyunjoon Cheon and Yo-Sub Han
    In Proceedings of the 27th International Conference on Developments in Language Theory (DLT'23), LNCS 13911, 61-73, 2023 [link]

  38. Contrastive Learning with Keyword-based Data Augmentation for Code Search and Code Question Answering
    Shinwoo Park, Youngwook Kim and Yo-Sub Han
    In Proceedings of the 17th Conference of the European Chapter of the Association for Computational Linguistics (EACL'23), 3609--3619, 2023 [pdf]

  39. Automated Grading of Regular Expressions
    Su-Hyeon Kim, Youngwook Kim, Yo-Sub Han, Hyeonseung Im and Sang-Ki Ko
    In Proceedings of the 32nd European Symposium on Programming (ESOP'23), LNCS 13990, 90--112, 2023 [link]

  40. Simon's Congruence Pattern Matching
    Sungmin Kim, Sang-Ki Ko and Yo-Sub Han
    In Proceedings of the 33rd International Symposium on Algorithms and Computation (ISAAC'22), 60:1--60:17, 2022 [link]

  41. Boosting Code Summarization by Embedding Code Structures
    Jikyoeng Son, Joonghyuk Hahn, HyeonTae Seo and Yo-Sub Han
    In Proceedings of the 29th International Conference on Computational Linguistics (COLING'22), 5966--5977, 2022 [pdf]

  42. Generalizable Implicit Hate Speech Detection using Contrastive Learning
    Youngwook Kim, Shinwoo Park and Yo-Sub Han
    In Proceedings of the 29th International Conference on Computational Linguistics (COLING'22), 6667--6679, 2022 [pdf]

  43. On Simon's Congruence Closure of a String
    Sungmin Kim, Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 24th International Conference on Descriptional Complexity of Formal Systems (DCFS'22), LNCS 13439, 127--141, 2022 [link]

  44. How to Settle the ReDoS Problem: Back to the Classical Automata Theory
    Sicheol Sung, Hyunjoon Cheon and Yo-Sub Han
    In Proceedings of the 26th International Conference on Implementation and Application of Automata (CIAA'22), LNCS 13266, 34--49, 2022 [link]

  45. On the Decidability of Infix Inclusion Problem
    Hyunjoon Cheon, Joonghyuk Hahn and Yo-Sub Han
    In Proceedings of the 26th International Conference on Developments in Language Theory (DLT'22), LNCS 13257, 115-126, 2022 [link]

  46. ALP: Data Augmentation using Lexicalized PCFGs for Few-Shot Text Classification
    Hazel Kim, Daecheol Woo, Seong Joon Oh, Jeong-Won Cha and Yo-Sub Han
    In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI-22), 10894-10902, 2022 [pdf]

  47. MultiFix: Learning to Repair Multiple Errors by Optimal Alignment Learning
    HyeonTae Seo, Yo-Sub Han and Sang-Ki Ko
    In Findings of the 2021 Conference on Empirical Methods in Natural Language Processing (EMNLP-Findings 2021), 4850--4855, 2021 [link]

  48. Self-Training using Rules of Grammar for Few-Shot NLU
    Joonghyuk Hahn, Hyunjoon Cheon, Kyuyeol Han, Cheongjae Lee, Junseok Kim and Yo-Sub Han
    In Findings of the 2021 Conference on Empirical Methods in Natural Language Processing (EMNLP-Findings 2021), 4576--4581, 2021 [link]

  49. Most Pseudo-copy Languages Are Not Context-free
    Hyunjoon Cheon, Joonghyuk Hahn, Yo-Sub Han and Sang-Ki Ko
    In Proceedings of the 27th Annual International Computing and Combinatorics Conference (COCOON'21), 189--200, 2021 [pdf]

  50. Do Bugs Propagate? An Empirical Analysis of Temporal Correlations Among Software Bugs
    Xiaodong Gu, Yo-Sub Han, Sunghun Kim and Hongyu Zhang
    In Proceedings of the 35th European Conference on Object-Oriented Programming (ECOOP 2021), 11:1--11:21, 2021 [pdf]

  51. SALNet: Semi-supervised Few-Shot Text Classification with Attention-based Lexicon Construction
    Ju-Hyoung Lee, Sang-Ki Ko and Yo-Sub Han
    In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI-21), 13189--13198, 2021 [pdf]

  52. SW Runtime Estimation using Automata Theory and Deep Learning on HPC
    Hyunjoon Cheon, Jinseung Ryu, Chan Yeol Park and Yo-Sub Han
    In Proceedings of 2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems Companion (ACSOS-C), 7--12, 2020

  53. Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
    Hyunjoon Cheon and Yo-Sub Han
    In Proceedings of the 24th International Conference on Developments in Language Theory (DLT'20), LNCS 12086, 43--54, 2020

  54. SoftRegex: Generating Regex from Natural Language Description using Softened Regex Equivalence
    Jun-U Park, Sang-Ki Ko, Marco Cognetta and Yo-Sub Han
    In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), 6426--6432, 2019

  55. Detecting context abusiveness using hierarchical deep learning
    Ju-Hyoung Lee, Jun-U Park, Jeong-Won Cha and Yo-Sub Han
    In Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom: Censorship, Disinformation, and Propaganda, 10--19, 2019

  56. The Relative Edit-Distance Between Two Input-Driven Languages
    Hyunjoon Cheon, Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 23rd International Conference on Developments in Language Theory (DLT'19), LNCS 11647, 127--139, 2019

  57. Online Infix Probability Computation for Probabilistic Finite Automata
    Marco Cognetta, Yo-Sub Han and Soon Chan Kwon
    In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics (ACL'19), 5332--5337, 2019

  58. A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata
    Yo-Sub Han, Hwee Kim, Yusei Masuda and Shinnosuke Seki
    In Proceedings of the 24th International Conference on Implementation and Application of Automata (CIAA'19), LNCS 11601, 146--157, 2019

  59. Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity
    Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 21st International Conference on Descriptional Complexity of Formal Systems (DCFS'19), LNCS 11612, 158--170, 2019

  60. Incremental Computation of Infix Probabilities for Probabilistic Finite Automata
    Marco Cognetta, Yo-Sub Han and Soon Chan Kwon
    In Proceedings of 2018 Conference on Empirical Methods in Natural Language Processing (EMNLP'18), 2732--2741, 2018

  61. Transcript Design Problem of Oritatami Systems
    Yo-Sub Han, Hwee Kim and Shinnosuke Seki
    In Proceedings of the 24th International Conference on DNA Computing and Molecular Programming (DNA24), LNCS 11145, 139--154, 2018

  62. Construction of Geometric Structure by Oritatami System
    Yo-Sub Han and Hwee Kim
    In Proceedings of the 24th International Conference on DNA Computing and Molecular Programming (DNA24), LNCS 11145, 173--188, 2018

  63. Site-Directed Deletion
    Da-Jung Cho, Yo-Sub Han, Hwee Kim and Kai Salomaa
    In Proceedings of the 22nd International Conference on Developments in Language Theory (DLT'18), LNCS 11088, 219--230, 2018

  64. Closest Substring Problems for Regular Languages
    Yo-Sub Han, Sang-Ki Ko, Timothy Ng and Kai Salomaa
    In Proceedings of the 22nd International Conference on Developments in Language Theory (DLT'18), LNCS 11088, 392--403, 2018

  65. Online Stochastic Pattern Matching
    Marco Cognetta and Yo-Sub Han
    In Proceedings of the 23rd International Conference on Implementation and Application of Automata (CIAA'18), LNCS 10977, 121--132, 2018

  66. Site-Directed Insertion: Decision Problems, Maximality and Minimality
    Da-Jung Cho, Yo-Sub Han, Kai Salomaa and Taylor Smith
    In Proceedings of the 20th International Conference on Descriptional Complexity of Formal Systems (DCFS'18), LNCS 10952, 49--61, 2018

  67. Ruleset Optimization on Isomorphic Oritatami Systems
    Yo-Sub Han and Hwee Kim
    In Proceedings of the 23rd International Conference on DNA Computing and Molecular Programming (DNA23), LNCS 10467, 33--45, 2017

  68. Self-attraction Removal from Oritatami Systems
    Yo-Sub Han, Hwee Kim, Trent Rogers and Shinnosuke Seki
    In Proceedings of the 19th International Conference on Descriptional Complexity of Formal Systems (DCFS'17), LNCS 10316, 164--176, 2017

  69. Alignment Distance of Regular Tree Languages
    Yo-Sub Han and Sang-Ki Ko
    In Proceedings of the 22nd International Conference on Implementation and Application of Automata (CIAA'17), LNCS 10329, 126--137, 2017

  70. Template-based Pattern Matching in Two-dimensional Arrays
    Yo-Sub Han and Daniel Prusa
    In Proceedings of the 18th International Workshop on Combinatorial Image Analysis (IWCIA'17), LNCS 10256, 79--92, 2017

  71. Deduplication on Finite Automata and Nested Duplication Systems
    Da-Jung Cho, Yo-Sub Han and Hwee Kim
    In Proceedings of Unconventional Computation & Natural Computation 2017 (UCNC'17), LNCS 10240, 196--207, 2017

  72. Consensus String Problem for Multiple Regular Languages
    Yo-Sub Han, Sang-Ki Ko, Timothy Ng and Kai Salomaa
    In Proceedings of the 11th International Conference on Language and Automata Theory and Applications (LATA'17), LNCS 10168, 196--207, 2017

  73. Edit-Distance between Visibly Pushdown Languages
    Yo-Sub Han and Sang-Ki Ko
    In Proceedings of the 43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'17), LNCS 10139, 387--401, 2017

  74. Nondeterministic seedless oritatami systems and hardness of testing their equivalence
    Yo-Sub Han, Hwee Kim, Makoto Ota and Shinnosuke Seki
    In Proceedings of the 22nd International Conference on DNA Computing and Molecular Programming (DNA22), LNCS 9818, 19--34, 2016 [pdf]

  75. Outfix-Guided Insertion
    Da-Jung Cho, Yo-Sub Han, Timothy Ng and Kai Salomaa
    In Proceedings of the 20th International Conference on Developments in Language Theory (DLT'16), LNCS 9840, 102--113, 2016 [pdf]

  76. Inferring a Relax NG Schema from XML Documents
    Guen-Hae Kim, Sang-Ki Ko and Yo-Sub Han
    In Proceedings of the 10th International Conference on Language and Automata Theory and Applications (LATA'16), LNCS 9618, 400--411, 2016 [pdf]

  77. Pseudoknot-Generating Operation
    Da-Jung Cho, Yo-Sub Han, Timothy Ng and Kai Salomaa
    In Proceedings of the 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'16), LNCS 9587, 241--252, 2016 [pdf]

  78. Duplications and Pseudo-Duplications
    Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis and Kai Salomaa
    In Proceedings of Unconventional Computation & Natural Computation 2015 (UCNC'15), LNCS 9252, 157--168, 2015 [pdf]

  79. Generalizations of Code Languages with Marginal Errors
    Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 19th International Conference on Developments in Language Theory (DLT'15), LNCS 9168, 264--275, 2015 [pdf]

  80. The State Complexity of Permutations on Finite Languages over Binary Alphabets
    Alexandros Palioudakis, Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 17th International Workshop on Descriptional Complexity of Formal Systems (DCFS'15), LNCS 9118, 220--230, 2015 [pdf]

  81. Frequent Pattern Mining with Non-overlapping Inversions
    Da-Jung Cho, Yo-Sub Han and Hwee Kim
    In Proceedings of the 9th International Conference on Language and Automata Theory and Applications (LATA'15), LNCS 8977, 121--132, 2015 [pdf]

  82. Online Multiple Palindrome Pattern Matching
    Hwee Kim and Yo-Sub Han
    In Proceedings of the 21st edition of the International Symposium on String Processing and Information Retrieval (SPIRE'14), LNCS 8799, 173--178, 2014 [pdf]

  83. Parallel CYK Membership Test on GPUs
    Kyoung-Hwan Kim, Sang-Min Choi, Hyein Lee, Ka Lok Man and Yo-Sub Han
    In Proceedings of the 11th IFIP International Conference on Network and Parallel Computing (NPC'14), LNCS 8707, 157--168, 2014 [pdf]

  84. Analyzing Item Features for Cold-Start Problems in Recommendation Systems
    Soryoung Kim, Sang-Min Choi, Yo-Sub Han, Ka Lok Man and Kaiyu Wan
    In Proceedings of the 2014 Tenth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP'14), 167--170, 2014 [pdf]

  85. State Complexity of Deletion
    Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 18th International Conference on Developments in Language Theory (DLT'14), LNCS 8633, 37--48, 2014 [pdf]

  86. State Complexity of Inversion Operations
    Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 16th International Workshop on Descriptional Complexity of Formal Systems (DCFS'14), LNCS 8614, 102--113, 2014 [pdf]

  87. State Complexity of Regular Tree Languages for Tree Pattern Matching
    Sang-Ki Ko, Ha-Rim Lee and Yo-Sub Han
    In Proceedings of the 16th International Workshop on Descriptional Complexity of Formal Systems (DCFS'14), LNCS 8614, 246--257, 2014 [pdf]

  88. Left is Better Than Right for Reducing Nondeterminism of NFAs
    Sang-Ki Ko and Yo-Sub Han
    In Proceedings of the 19th International Conference on Implementation and Application of Automata (CIAA'14), LNCS 8587, 238--251, 2014 [pdf]

  89. Pseudo-Inversion on Formal Languages
    Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko and Kai Salomaa
    In Proceedings of Unconventional Computation & Natural Computation 2014 (UCNC'14), LNCS 8553, 93--104, 2014 [BEST PAPER] [pdf]

  90. Space-efficient Approximate String Matching Allowing Inversions in Fast Average Time
    Hwee Kim and Yo-Sub Han
    In Proceedings of the 8th International Frontiers of Algorithmics Workshop (FAW'14), LNCS 8497, 261--272, 2014 [pdf]

  91. Top-Down Tree Edit-Distance of Regular Tree Languages
    Sang-Ki Ko, Yo-Sub Han and Kai Salomaa
    In Proceedings of the 8th International Conference on Language and Automata Theory and Applications (LATA'14), LNCS 8370, 466--477, 2014 [pdf]

  92. Alignment with Non-Overlapping Inversions on Two Strings
    Da-Jung Cho, Yo-Sub Han and Hwee Kim
    In Proceedings of the 8th International Workshop on Algorithms and Computation (WALCOM'14), LNCS 8344 261--272, 2014 [pdf]

  93. A CA Model for Target Tracking in Distributed Mobile Wireless Sensor Network
    Sang-Ki Ko, Hwee Kim and Yo-Sub Han
    In Proceedings of the 13th International Conference on Control, Automation and Systems (ICCAS'13), 1356--1361, 2013 [pdf]

  94. State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
    Hae-Sung Eom, Yo-Sub Han and Kai Salomaa
    In Proceedings of the 15th International Workshop on Descriptional Complexity of Formal Systems (DCFS'13), LNCS 8031, 78--89, 2013 [pdf]

  95. State Complexity of Subtree-Free Regular Tree Languages
    Hae-Sung Eom, Yo-Sub Han and Sang-Ki Ko
    In Proceedings of the 15th International Workshop on Descriptional Complexity of Formal Systems (DCFS'13), LNCS 8031, 66--77, 2013 [pdf]

  96. State Complexity of Basic Operations on Non-Returning Regular Languages
    Hae-Sung Eom, Yo-Sub Han and Galina Jiraskova
    In Proceedings of the 15th International Workshop on Descriptional Complexity of Formal Systems (DCFS'13), LNCS 8031, 54--65, 2013 [pdf]

  97. Approximate Matching between a Context-Free Grammar and a Finite-State Automaton
    Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 18th International Conference on Implementation and Application of Automata (CIAA'13), LNCS 7982, 146--157, 2013 [pdf]

  98. Identifying representative ratings for a new item in recommendation system
    Sang-Min Choi and Yo-Sub Han
    In Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication (ICUIMC 2013) [pdf]

  99. Computing the edit-distance between a regular language and a context-free language
    Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 16th International Conference on Developments in Language Theory (DLT'12), LNCS 7410, 85--96, 2012 [pdf]

  100. A recommendation system based on a subset of raters
    Bernhard Scholz, Sang-Min Choi, Sang-Ki Ko, Hae-Sung Eom and Yo-Sub Han
    In Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication (ICUIMC 2012) [pdf]

  101. Generalized One-Unambiguity
    Pascal Caron, Yo-Sub Han and Ludovic Mignot
    In Proceedings of the 15th International Conference on Developments in Language Theory (DLT'11), LNCS 6795, 129--140, 2011 [pdf]

  102. A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule
    Yo-Sub Han and Sang-Ki Ko
    In Proceedings of the 16th International Conference on Implementation and Application of Automata (CIAA'11), LNCS 6807, 154--165, 2011 [pdf]

  103. A Smart Movie Recommendation System
    Sang-Ki Ko, Sang-Min Choi, Hae-Sung Eom, Jeong-Won Cha, Hyunchul Cho, Laehyun Kim and Yo-Sub Han
    In Proceedings of the HCI International 2011 (HCII'11), LNCS 6771, 558--566, 2011 [pdf]

  104. Reliability of Representative Reviewers on the Web
    Sang-Min Choi, Jeong-Won Cha, Lae-Hyun Kim and Yo-Sub Han
    In Proceedings of the 2011 International Conference on Information Science and Applications (ICISA 2011)

  105. Predicting Phrase-Level Tags Using Entropy Inspired Discriminative Models
    Jin Young Oh, Yo-Sub Han, Jeongyeul Park and Jeong-Won Cha
    In Proceedings of the 2011 International Conference on Information Science and Applications (ICISA 2011)

  106. Analyzing Category Correlations for Recommendation System
    Bernhard Scholz, Sang-Min Choi, Sang-Ki Ko, Hae-Sung Eom and Yo-Sub Han
    In Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication (ICUIMC 2011) [pdf]

  107. Nondeterministic State Complexity for Suffix-Free Regular Languages
    Yo-Sub Han and Kai Salomaa
    In Proceedings of the 12th International Workshop on Descriptional Complexity of Formal Systems (DCFS'10), 189--196, 2010 [pdf]

  108. Identifying Representative Reviewers in Internet Social Media
    Sang-Min Choi, Jeong-Won Cha and Yo-Sub Han
    In Computational Collective Intelligence Technologies and Applications - Second International Conference (ICCCI'10), LNCS 6422, 22--30, 2010 [pdf]

  109. A Content Recommendation System Based on Category Correlations
    Sang-Min Choi and Yo-Sub Han
    In Proceedings of the 5th International Multi-conference on Computing in the Global Information Technology (ICCGI'10), 66--70, 2010 [pdf]

  110. Implementation of State Elimination using Heuristics
    Jae-Hee Ahn and Yo-Sub Han
    In Proceedings of the 14th International Conference on Implementation and Application of Automata (CIAA'09), LNCS 5642, 178--187, 2009 [pdf]

  111. State Complexity of Combined Operations for Prefix-Free Regular Languages
    Yo-Sub Han Kai Salomaa and Sheng Yu
    In Proceedings of the 3rd International Conference on Language and Automata Theory and Applications (LATA'09), LNCS 5457, 398--409, 2009 [pdf]

  112. Evaluation of User Reputation on YouTube
    Yo-Sub Han, Laehyun Kim and Jeong-Won Cha
    In Proceedings of the HCI International 2009 (HCII'09), LNCS 5621, 346--353, 2009 [pdf]

  113. User Reputation Evaluation Using Co-occurrence Feature and Collective Intelligence
    Jeong-Won Cha, Hyun-woo Lee, Yo-Sub Han and Laehyun Kim
    In Proceedings of the HCI International 2009 (HCII'09), LNCS 5621, 305--311, 2009 [pdf]

  114. A Ranking Algorithm for User-generated Video Contents based on Social Activities
    Lisa Wiyartanti, Yo-Sub Han and Laehyun Kim
    In Proceedings of the 3rd International Conference on Digital Information Management (ICDIM'08), 260--265, 2008 [pdf]

  115. Infrastructure for Ontological Resource Matching in a Virtual Organization
    Michal Szymczak, Grzegorz Frackowiak, Maciej Gawinecki, Maria Ganzha, Marcin Paprzycki, Sang Keun Rhee, Myon-Woong Park, Yo-Sub Han, Young Tae Sohn, Jihye Lee, Jae Kawn Kim
    In Proceedings of the 2nd International Symposium on Intelligent Distributed Computing (IDC'08), 11--22, 2008 [pdf]

  116. On Resource Profiling and Matching in an Agent-Based Virtual Organization
    Grzegorz Frackowiak, Maciej Gawinecki, Maria Ganzha, Marcin Paprzycki, Michal Szymczak, Myon-Woong Park, Yo-Sub Han
    In Proceedings of the 9th International Conference on Artificial Intelligence and Soft Computing (ICAISC'08), LNCS 5097, 1210--1221, 2008 [pdf]

  117. Generic Framework for Agent Adaptability and Utilization in a Virtual Organization - Preliminary Considerations
    Maria Ganzha, Maciej Gawinecki, Michal Szymczak, Grzegorz Frackowiak, Marcin Paprzycki, Myon-Woong Park, Yo-Sub Han, Y.T. Sohn
    In Proceedings of the 2008 WEBIST Conference 2008 [pdf]

  118. Adaptive Information Provisioning in an Agent-Based Virtual Organization - Ontologies in the System
    Michal Szymczak, Grzegorz Frackowiak, Maciej Gawinecki, Maria Ganzha, Marcin Paprzycki, Myon-Woong Park, Yo-Sub Han, Y.T. Sohn
    In Proceedings of the 2nd KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (KES AMSTA), LNCS 4953, 271--280, 2008 [pdf]

  119. State Complexity of Basic Operations on Suffix-Free Regular Languages
    Yo-Sub Han and Kai Salomaa
    In Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS'07), LNCS 4708, 501--512, 2007 [pdf]

  120. State Complexity of Union and Intersection of Finite Languages
    Yo-Sub Han and Kai Salomaa
    In Proceedings of the 11th International Conference on Developments in Language Theory (DLT'07), LNCS 4588, 217--228, 2007 [pdf]

  121. Generalizations of One-Deterministic Regular Languages
    Yo-Sub Han and Derick Wood
    In Proceedings of the 1st International Conference on Language and Automata Theory and Applications (LATA'07), 273--285, 2007

  122. Overlap-Free Regular Languages
    Yo-Sub Han and Derick Wood
    In Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON'06), LNCS 4112, 469--478, 2006 [pdf]

  123. State Complexity of Prefix-Free Regular Languages
    Yo-Sub Han, Kai Salomaa and Derick Wood
    in Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems (DCFS'06), 165--176, 2006 [pdf]

  124. Prime Decompositions of Regular Languages
    Yo-Sub Han, Kai Salomaa and Derick Wood
    In Proceedings of the Tenth International Conference on Developments in Language Theory (DLT'06), LNCS 4036, 145--155, 2006 [pdf]

  125. Outfix-free Regular Languages and Prime Outfix-free Decomposition
    Yo-Sub Han and Derick Wood
    In Proceedings of the Second International Colloquium on Theoretical Aspects of Computing (ICTAC'05), LNCS 3722, 96--109, 2005 [pdf]

  126. When Western Devil and Chinese Knight Play Go
    Yo-Sub Han and Gerhard Trippen
    in Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA'05), 399--408, 2005

  127. A New Linearizing Restriction in the Pattern Matching Problem
    Yo-Sub Han and Derick Wood
    in Proceedings of the 15th International Symposium on Fundamentals of Computation Theory (FCT'05), LNCS 3623, 552--562, 2005 [pdf]

  128. Shorter Regular Expressions from Finite-state Automata
    Yo-Sub Han and Derick Wood
    in Proceedings of the 10th International Conference on Implementation and Application of Automata (CIAA'05), LNCS 3845, 141--152, 2005 [pdf]

  129. Simple-Regular Expressions and Languages
    Yo-Sub Han, Gerhard Trippen and Derick Wood
    in Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems (DCFS'05), 146--157, 2005 [pdf]

  130. Prefix-Free Regular-Expression Matching
    Yo-Sub Han, Yajun Wang and Derick Wood
    in Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM'05), LNCS 3537, 298--309, 2005 [pdf]

  131. The Generalization of Generalized Automata: Expression Automata
    Yo-Sub Han and Derick Wood
    in Proceedings of the 9th International Conference on Implementation and Application of Automata (CIAA'04), LNCS 3317, 156--166, 2004 [pdf]

Chapters in Books

  1. Computing the Edit-Distance between a Tree and a Regular Tree Language
    Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    in Multidisciplinary Creativity. Homage to Gheorghe Paun on his 65th Birthday, Spandugino, 249--260, 2015

  2. State Complexity of Combined Operations for Prefix-Free Regular Languages
    Hae-Sung Eom, Yo-Sub Han, Kai Salomaa and Sheng Yu
    in Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005), Editura Academiei, Bucuresti (The Publishing House of the Romanian Academy, Bucharest), 137--152, 2014

  3. Operational State Complexity of Prefix-Free Regular Languages
    Yo-Sub Han, Kai Salomaa and Derick Wood
    in Automata, Formal Languages, and Related Topics-Dedicated to Ferenc Gécseg on the occasion of his 70th birthday, Institue of Informatics, University of Szeged, Hungary, 99--116, 2009

  4. Considering Resource Management in Agent-Based Virtual Organization
    Grzegorz Frackowiak, Maria Ganzha, Maciej Gawinecki, Marcin Paprzycki, Michal Szymczak, Myon-Woong Park, Yo-Sub Han
    In Intelligent Agents in the Evolution of Web and Applications, Advances in Computational Intelligence Series, 161--190, 2009 [pdf]

*Copyright Notice: all papers are presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

HOME
Last updated 2018/04/20