Yo-Sub Han

According to our database, Yo-Sub Han authored at least 154 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

CodeComplex: A Time-Complexity Dataset for Bilingual Source Codes.

Seung-Yeop Baik, Mingi Jeon, Joonghyuk Hahn, Jungin Kim, Yo-Sub Han, Sang-Ki Ko

CoRR, 2024

2023

ARED: automata-based runtime estimation for distributed systems using deep learning.

Hyunjoon Cheon, Jinseung Ryu, Jaecheol Ryou, Chan Yeol Park, Yo-Sub Han

Clust. Comput., October, 2023

On Simon's congruence closure of a string.

Sungmin Kim, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa

Theor. Comput. Sci., September, 2023

Deciding path size of nondeterministic (and input-driven) pushdown automata.

Yo-Sub Han, Sang-Ki Ko, Kai Salomaa

Theor. Comput. Sci., 2023

An Empirical Study on Multimodal Activity Clustering of Android Applications.

Sungmin Choi, Hyeon-Tae Seo, Yo-Sub Han

IEEE Access, 2023

Smaller Representation of Compiled Regular Expressions.

Sicheol Sung, Sang-Ki Ko, Yo-Sub Han

Proceedings of the Implementation and Application of Automata, 2023

M-equivalence of Parikh Matrix over a Ternary Alphabet.

Joonghyuk Hahn, Hyunjoon Cheon, Yo-Sub Han

Proceedings of the Implementation and Application of Automata, 2023

Automated Grading of Regular Expressions.

Su-Hyeon Kim, Youngwook Kim, Yo-Sub Han, Hyeonseung Im, Sang-Ki Ko

Proceedings of the Programming Languages and Systems, 2023

ConPrompt: Pre-training a Language Model with Machine-Generated Data for Implicit Hate Speech Detection.

Youngwook Kim, Shinwoo Park, Youngsoo Namgoong, Yo-Sub Han

Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2023, 2023

ATHENA: Mathematical Reasoning with Thought Expansion.

JB. Kim, Hazel Kim, Joonghyuk Hahn, Yo-Sub Han

Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, 2023

GDA: Grammar-based Data Augmentation for Text Classification using Slot Information.

Joonghyuk Hahn, Hyunjoon Cheon, Elizabeth Orwig, Su-Hyeon Kim, Sang-Ki Ko, Yo-Sub Han

Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2023, 2023

Contrastive Learning with Keyword-based Data Augmentation for Code Search and Code Question Answering.

Shinwoo Park, Youngwook Kim, Yo-Sub Han

Proceedings of the 17th Conference of the European Chapter of the Association for Computational Linguistics, 2023

On the Simon's Congruence Neighborhood of Languages.

Sungmin Kim, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa

Proceedings of the Developments in Language Theory - 27th International Conference, 2023

Weak Inverse Neighborhoods of Languages.

Hyunjoon Cheon, Yo-Sub Han

Proceedings of the Developments in Language Theory - 27th International Conference, 2023

Existential and Universal Width of Alternating Finite Automata.

Yo-Sub Han, Sungmin Kim, Sang-Ki Ko, Kai Salomaa

Proceedings of the Descriptional Complexity of Formal Systems, 2023

JIDECA: Jointly Improved Deep Embedded Clustering for Android activity.

Sungmin Choi, Hyeon-Tae Seo, Yo-Sub Han

Proceedings of the IEEE International Conference on Big Data and Smart Computing, 2023

2022

Neuro-Symbolic Regex Synthesis Framework via Neural Example Splitting.

Su-Hyeon Kim, Hyunjoon Cheon, Yo-Sub Han, Sang-Ki Ko

CoRR, 2022

LST: Lexicon-Guided Self-Training for Few-Shot Text Classification.

Hazel Kim, Jaeman Son, Yo-Sub Han

CoRR, 2022

How to Settle the ReDoS Problem: Back to the Classical Automata Theory.

Sicheol Sung, Hyunjoon Cheon, Yo-Sub Han

Proceedings of the Implementation and Application of Automata, 2022

Simon's Congruence Pattern Matching.

Sungmin Kim, Sang-Ki Ko, Yo-Sub Han

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

On the Decidability of Infix Inclusion Problem.

Hyunjoon Cheon, Joonghyuk Hahn, Yo-Sub Han

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

Boosting Code Summarization by Embedding Code Structures.

Jikyoeng Son, Joonghyuk Hahn, HyeonTae Seo, Yo-Sub Han

Proceedings of the 29th International Conference on Computational Linguistics, 2022

Generalizable Implicit Hate Speech Detection Using Contrastive Learning.

Youngwook Kim, Shinwoo Park, Yo-Sub Han

Proceedings of the 29th International Conference on Computational Linguistics, 2022

ALP: Data Augmentation Using Lexicalized PCFGs for Few-Shot Text Classification.

Hazel H. Kim, Daecheol Woo, Seong Joon Oh, Jeong-Won Cha, Yo-Sub Han

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Closest substring problems for regular languages.

Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa

Theor. Comput. Sci., 2021

A general architecture of oritatami systems for simulating arbitrary finite automata.

Yo-Sub Han, Hwee Kim, Yusei Masuda, Shinnosuke Seki

Theor. Comput. Sci., 2021

Impossibility of strict assembly of infinite fractals by oritatami.

Yo-Sub Han, Hwee Kim

Nat. Comput., 2021

Generalizations of Code Languages with Marginal Errors.

Sang-Ki Ko, Yo-Sub Han, Kai Salomaa

Int. J. Found. Comput. Sci., 2021

Left is Better Than Right for Reducing Nondeterminism of NFAs.

Sang-Ki Ko, Yo-Sub Han

Int. J. Found. Comput. Sci., 2021

Consensus string problem for multiple regular languages.

Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa

Inf. Comput., 2021

MultiFix: Learning to Repair Multiple Errors by Optimal Alignment Learning.

HyeonTae Seo, Yo-Sub Han, Sang-Ki Ko

Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2021, 2021

Self-Training using Rules of Grammar for Few-Shot NLU.

Joonghyuk Hahn, Hyunjoon Cheon, Kyuyeol Han, Cheongjae Lee, Junseok Kim, Yo-Sub Han

Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2021, 2021

Do Bugs Propagate? An Empirical Analysis of Temporal Correlations Among Software Bugs.

Xiaodong Gu, Yo-Sub Han, Sunghun Kim, Hongyu Zhang

Proceedings of the 35th European Conference on Object-Oriented Programming, 2021

Most Pseudo-copy Languages Are Not Context-Free.

Hyunjoon Cheon, Joonghyuk Hahn, Yo-Sub Han, Sang-Ki Ko

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

SALNet: Semi-supervised Few-Shot Text Classification with Attention-based Lexicon Construction.

Ju Hyoung Lee, Sang-Ki Ko, Yo-Sub Han

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Transcript design problem of oritatami systems.

Yo-Sub Han, Hwee Kim, Shinnosuke Seki

Nat. Comput., 2020

Computing the Shortest String and the Edit-Distance for Parsing Expression Languages.

Hyunjoon Cheon, Yo-Sub Han

Proceedings of the Developments in Language Theory - 24th International Conference, 2020

SW Runtime Estimation using Automata Theory and Deep Learning on HPC.

Hyunjoon Cheon, Jinseung Ryu, Chan Yeol Park, Yo-Sub Han

Proceedings of the 2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems, 2020

2019

Alignment distance of regular tree languages.

Yo-Sub Han, Sang-Ki Ko

Theor. Comput. Sci., 2019

Ruleset optimization on isomorphic oritatami systems.

Yo-Sub Han, Hwee Kim

Theor. Comput. Sci., 2019

Site-directed insertion: Language equations and decision problems.

Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith

Theor. Comput. Sci., 2019

Bound-decreasing duplication system.

Da-Jung Cho, Yo-Sub Han, Hwee Kim

Theor. Comput. Sci., 2019

Self-Attraction Removal from Oritatami Systems.

Yo-Sub Han, Hwee Kim, Trent A. Rogers, Shinnosuke Seki

Int. J. Found. Comput. Sci., 2019

Cyclic Oritatami Systems Cannot Fold Infinite Fractal Curves.

Yo-Sub Han, Hwee Kim

CoRR, 2019

SoftRegex: Generating Regex from Natural Language Descriptions using Softened Regex Equivalence.

Jun-U. Park, Sang-Ki Ko, Marco Cognetta, Yo-Sub Han

Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing, 2019

The Relative Edit-Distance Between Two Input-Driven Languages.

Hyunjoon Cheon, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa

Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity.

Yo-Sub Han, Sang-Ki Ko, Kai Salomaa

Proceedings of the Descriptional Complexity of Formal Systems, 2019

Online Infix Probability Computation for Probabilistic Finite Automata.

Marco Cognetta, Yo-Sub Han, Soon Chan Kwon

Proceedings of the 57th Conference of the Association for Computational Linguistics, 2019

2018

Nondeterministic seedless oritatami systems and hardness of testing their equivalence.

Yo-Sub Han, Hwee Kim, Makoto Ota, Shinnosuke Seki

Nat. Comput., 2018

Growth Rate of Minimum Branching.

Alexandros Palioudakis, Yo-Sub Han, Kai Salomaa

J. Autom. Lang. Comb., 2018

An abusive text detection system based on enhanced abusive and non-abusive word lists.

Ho-Suk Lee, Hong-Rae Lee, Jun-U. Park, Yo-Sub Han

Decis. Support Syst., 2018

OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems.

Sang-Min Choi, Jiho Park, Quan Hoang Nguyen, Andre Cronje, Ki-Young Jang, Hyunjoon Cheon, Yo-Sub Han, Byung-Ik Ahn

CoRR, 2018

Online Stochastic Pattern Matching.

Marco Cognetta, Yo-Sub Han

Proceedings of the Implementation and Application of Automata, 2018

Incremental Computation of Infix Probabilities for Probabilistic Finite Automata.

Marco Cognetta, Yo-Sub Han, Soon Chan Kwon

Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Brussels, Belgium, October 31, 2018

Construction of Geometric Structure by Oritatami System.

Yo-Sub Han, Hwee Kim

Proceedings of the DNA Computing and Molecular Programming - 24th International Conference, 2018

Site-Directed Deletion.

Da-Jung Cho, Yo-Sub Han, Hwee Kim, Kai Salomaa

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Site-Directed Insertion: Decision Problems, Maximality and Minimality.

Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith

Proceedings of the Descriptional Complexity of Formal Systems, 2018

2017

Outfix-guided insertion.

Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa

Theor. Comput. Sci., 2017

Pseudoknot-generating operation.

Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa

Theor. Comput. Sci., 2017

State complexity of permutation on finite languages over a binary alphabet.

Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, Alexandros Palioudakis, Kai Salomaa

Theor. Comput. Sci., 2017

Preface.

Yo-Sub Han, Kai Salomaa

Int. J. Found. Comput. Sci., 2017

State Complexity of k-Parallel Tree Concatenation.

Yo-Sub Han, Sang-Ki Ko, Kai Salomaa

Fundam. Informaticae, 2017

Ambiguity, Nondeterminism and State Complexity of Finite Automata.

Yo-Sub Han, Arto Salomaa, Kai Salomaa

Acta Cybern., 2017

Deduplication on Finite Automata and Nested Duplication Systems.

Da-Jung Cho, Yo-Sub Han, Hwee Kim

Proceedings of the Unconventional Computation and Natural Computation, 2017

Edit-Distance Between Visibly Pushdown Languages.

Yo-Sub Han, Sang-Ki Ko

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Template-Based Pattern Matching in Two-Dimensional Arrays.

Yo-Sub Han, Daniel Prusa

Proceedings of the Combinatorial Image Analysis - 18th International Workshop, 2017

2016

State complexity of inversion operations.

Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa

Theor. Comput. Sci., 2016

Pseudo-inversion: closure properties and decidability.

Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko, Kai Salomaa

Nat. Comput., 2016

Duplications and Pseudo-Duplications.

Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa

Int. J. Unconv. Comput., 2016

State Complexity of Regular Tree Languages for Tree Matching.

Sang-Ki Ko, Ha-Rim Lee, Yo-Sub Han

Int. J. Found. Comput. Sci., 2016

Operational State Complexity of Subtree-Free Regular Tree Languages.

Sang-Ki Ko, Hae-Sung Eom, Yo-Sub Han

Int. J. Found. Comput. Sci., 2016

State Complexity of Insertion.

Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa

Int. J. Found. Comput. Sci., 2016

Approximate matching between a context-free grammar and a finite-state automaton.

Sang-Ki Ko, Yo-Sub Han, Kai Salomaa

Inf. Comput., 2016

State Complexity of Basic Operations on Non-Returning Regular Languages.

Hae-Sung Eom, Yo-Sub Han, Galina Jirásková

Fundam. Informaticae, 2016

OMPPM: online multiple palindrome pattern matching.

Hwee Kim, Yo-Sub Han

Bioinform., 2016

State complexity of deletion and bipolar deletion.

Yo-Sub Han, Sang-Ki Ko, Kai Salomaa

Acta Informatica, 2016

Inferring a Relax NG Schema from XML Documents.

Guen-Hae Kim, Sang-Ki Ko, Yo-Sub Han

Proceedings of the Language and Automata Theory and Applications, 2016

Outfix-Guided Insertion - (Extended Abstract).

Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa

Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015

Non-overlapping inversion on strings and languages.

Hwee Kim, Yo-Sub Han

Theor. Comput. Sci., 2015

Alignment with non-overlapping inversions and translocations on two strings.

Da-Jung Cho, Yo-Sub Han, Hwee Kim

Theor. Comput. Sci., 2015

State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages.

Hae-Sung Eom, Yo-Sub Han, Kai Salomaa

Int. J. Found. Comput. Sci., 2015

State Complexity of Boundary of Prefix-Free Regular Languages.

Hae-Sung Eom, Yo-Sub Han

Int. J. Found. Comput. Sci., 2015

A Recommendation Model Using the Bandwagon Effect for E-Marketing Purposes in IoT.

Sang-Min Choi, Hyein Lee, Yo-Sub Han, Ka Lok Man, Woon Kian Chong

Int. J. Distributed Sens. Networks, 2015

State Complexity of Kleene-Star Operations on Regular Tree Languages.

Yo-Sub Han, Sang-Ki Ko, Xiaoxue Piao, Kai Salomaa

Acta Cybern., 2015

Frequent Pattern Mining with Non-overlapping Inversions.

Da-Jung Cho, Yo-Sub Han, Hwee Kim

Proceedings of the Language and Automata Theory and Applications, 2015

The State Complexity of Permutations on Finite Languages over Binary Alphabets.

Alexandros Palioudakis, Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa

Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014

Decidability of involution hypercodes.

Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko

Theor. Comput. Sci., 2014

A Speculative Parallel DFA Membership Test for Multicore, SIMD and Cloud Computing Environments.

Yousun Ko, Minyoung Jung, Yo-Sub Han, Bernd Burgstaller

Int. J. Parallel Program., 2014

Alignment with Non-overlapping Inversions on Two Strings.

Da-Jung Cho, Yo-Sub Han, Hwee Kim

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Pseudo-inversion on Formal Languages.

Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko, Kai Salomaa

Proceedings of the Unconventional Computation and Natural Computation, 2014

Online Multiple Palindrome Pattern Matching.

Hwee Kim, Yo-Sub Han

Proceedings of the String Processing and Information Retrieval, 2014

Parallel CYK Membership Test on GPUs.

Kyoung-Hwan Kim, Sang-Min Choi, Hyein Lee, Ka Lok Man, Yo-Sub Han

Proceedings of the Network and Parallel Computing, 2014

Top-Down Tree Edit-Distance of Regular Tree Languages.

Sang-Ki Ko, Yo-Sub Han, Kai Salomaa

Proceedings of the Language and Automata Theory and Applications, 2014

Analyzing Item Features for Cold-Start Problems in Recommendation Systems.

Soryoung Kim, Sang-Min Choi, Yo-Sub Han, Ka Lok Man, Kaiyu Wan

Proceedings of the 2014 Tenth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2014

Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time.

Hwee Kim, Yo-Sub Han

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

State Complexity of Deletion.

Yo-Sub Han, Sang-Ki Ko, Kai Salomaa

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

State Complexity of Regular Tree Languages for Tree Pattern Matching.

Sang-Ki Ko, Ha-Rim Lee, Yo-Sub Han

Proceedings of the Descriptional Complexity of Formal Systems, 2014

State Complexity of Combined Operations for Prefix-Free Regular Languages.

Hae-Sung Eom, Yo-Sub Han, Kai Salomaa, Sheng Yu

Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013

State complexity of combined operations for suffix-free regular languages.

Hae-Sung Eom, Yo-Sub Han

Theor. Comput. Sci., 2013

The Edit-Distance between a Regular Language and a Context-Free Language.

Yo-Sub Han, Sang-Ki Ko, Kai Salomaa

Int. J. Found. Comput. Sci., 2013

An Improved Prefix-Free Regular-Expression Matching.

Yo-Sub Han

Int. J. Found. Comput. Sci., 2013

State Elimination Heuristics for Short Regular Expressions.

Yo-Sub Han

Fundam. Informaticae, 2013

Representative reviewers for Internet social media.

Sang-Min Choi, Yo-Sub Han

Expert Syst. Appl., 2013

Identifying representative ratings for a new item in recommendation system.

Sang-Min Choi, Yo-Sub Han

Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication, 2013

State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages.

Hae-Sung Eom, Yo-Sub Han, Kai Salomaa

Proceedings of the Descriptional Complexity of Formal Systems, 2013

State Complexity of Subtree-Free Regular Tree Languages.

Hae-Sung Eom, Yo-Sub Han, Sang-Ki Ko

Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012

Analysis of a cellular automaton model for car traffic with a junction.

Yo-Sub Han, Sang-Ki Ko

Theor. Comput. Sci., 2012

A movie recommendation algorithm based on genre correlations.

Sang-Min Choi, Sang-Ki Ko, Yo-Sub Han

Expert Syst. Appl., 2012

Computing User Reputation in a Social Network of Web 2.0.

Yo-Sub Han, Laehyun Kim, Jeong-Won Cha

Comput. Informatics, 2012

A recommendation system based on a subset of raters.

Bernhard Scholz, Sang-Min Choi, Sang-Ki Ko, Hae-Sung Eom, Yo-Sub Han

Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication, 2012

Computing the Edit-Distance between a Regular Language and a Context-Free Language.

Yo-Sub Han, Sang-Ki Ko, Kai Salomaa

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011

Overlap-Free Languages and solid Codes.

Yo-Sub Han, Kai Salomaa

Int. J. Found. Comput. Sci., 2011

A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule.

Yo-Sub Han, Sang-Ki Ko

Proceedings of the Implementation and Application of Automata, 2011

Analyzing category correlations for recommendation system.

Bernhard Scholz, Sang-Min Choi, Sang-Ki Ko, Hae-Sung Eom, Yo-Sub Han

Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, 2011

A Smart Movie Recommendation System.

Sang-Ki Ko, Sang-Min Choi, Hae-Sung Eom, Jeong-Won Cha, Hyunchul Cho, Laehyun Kim, Yo-Sub Han

Proceedings of the Human Interface and the Management of Information. Interacting with Information, 2011

Generalized One-Unambiguity.

Pascal Caron, Yo-Sub Han, Ludovic Mignot

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010

On the Linear Number of Matching Substrings.

Yo-Sub Han

J. Univers. Comput. Sci., 2010

Nondeterministic State Complexity for Suffix-Free Regular Languages

Yo-Sub Han, Kai Salomaa

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Identifying Representative Reviewers in Internet Social Media.

Sang-Min Choi, Jeong-Won Cha, Yo-Sub Han

Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2010

2009

Considering Resource Management in Agent-Based Virtual Organization.

Grzegorz Frackowiak, Maria Ganzha, Maciej Gawinecki, Marcin Paprzycki, Michal Szymczak, Myon-Woong Park, Yo-Sub Han

Proceedings of the Intelligent Agents in the Evolution of Web and Applications, 2009

Nondeterministic state complexity of nested word automata.

Yo-Sub Han, Kai Salomaa

Theor. Comput. Sci., 2009

State complexity of basic operations on suffix-free regular languages.

Yo-Sub Han, Kai Salomaa

Theor. Comput. Sci., 2009

Adaptability in an agent-based virtual organisation.

Grzegorz Frackowiak, Maria Ganzha, Maciej Gawinecki, Marcin Paprzycki, Michal Szymczak, Costin Badica, Yo-Sub Han, Myon-Woong Park

Int. J. Agent Oriented Softw. Eng., 2009

Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages.

Yo-Sub Han, Kai Salomaa, Derick Wood

Fundam. Informaticae, 2009

Implementation of State Elimination Using Heuristics.

Jae-Hee Ahn, Yo-Sub Han

Proceedings of the Implementation and Application of Automata, 2009

State Complexity of Combined Operations for Prefix-Free Regular Languages.

Yo-Sub Han, Kai Salomaa, Sheng Yu

Proceedings of the Language and Automata Theory and Applications, 2009

Evaluation of User Reputation on YouTube.

Yo-Sub Han, Laehyun Kim, Jeong-Won Cha

Proceedings of the Online Communities and Social Computing, 2009

User Reputation Evaluation Using Co-occurrence Feature and Collective Intelligence.

Jeong-Won Cha, Hyun-woo Lee, Yo-Sub Han, Laehyun Kim

Proceedings of the Online Communities and Social Computing, 2009

Operational State Complexity of Prefix-Free Regular Languages.

Yo-Sub Han, Kai Salomaa, Derick Wood

Proceedings of the Automata, Formal Languages, and Related Topics, 2009

2008

State Complexity of Union and Intersection of Finite Languages.

Yo-Sub Han, Kai Salomaa

Int. J. Found. Comput. Sci., 2008

Generalizations of 1-deterministic regular languages.

Yo-Sub Han, Derick Wood

Inf. Comput., 2008

Adaptability in an Agent-Based Virtual Organization - Towards Implementation.

Grzegorz Frackowiak, Maria Ganzha, Marcin Paprzycki, Michal Szymczak, Yo-Sub Han, Myon-Woong Park

Proceedings of the Web Information Systems and Technologies, 4th International Conference, 2008

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, Young Tae Sohn

Proceedings of the Agent and Multi-Agent Systems: Technologies and Applications, 2008

Ontological matchmaking in a Duty Trip Support application in a virtual organization.

Michal Szymczak, Grzegorz Frackowiak, Maria Ganzha, Marcin Paprzycki, Sang Keun Rhee, Jihye Lee, Young Tae Sohn, Jae Kwan Kim, Yo-Sub Han, Myon-Woong Park

Proceedings of the International Multiconference on Computer Science and Information Technology, 2008

Infrastructure for Ontological Resource Matching in a Virtual Organization.

Michal Szymczak, Grzegorz Frackowiak, Maria Ganzha, Marcin Paprzycki, Sang Keun Rhee, Myon-Woong Park, Yo-Sub Han, Young Tae Sohn, Jihye Lee, Jae Kwan Kim

Proceedings of the Intelligent Distributed Computing, Systems and Applications, Proceedings of the 2nd International Symposium on Intelligent Distributed Computing, 2008

A ranking algorithm for user-generated video contents based on social activities.

Lisa Wiyartanti, Yo-Sub Han, Laehyun Kim

Proceedings of the Third IEEE International Conference on Digital Information Management (ICDIM), 2008

On Resource Profiling and Matching in an Agent-Based Virtual Organization.

Grzegorz Frackowiak, Maria Ganzha, Maciej Gawinecki, Marcin Paprzycki, Michal Szymczak, Myon-Woong Park, Yo-Sub Han

Proceedings of the Artificial Intelligence and Soft Computing, 2008

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, Young Tae Sohn

Proceedings of the ENASE 2008, 2008

2007

Prefix-free regular languages and pattern matching.

Yo-Sub Han, Yajun Wang, Derick Wood

Theor. Comput. Sci., 2007

Obtaining shorter regular expressions from finite-state automata.

Yo-Sub Han, Derick Wood

Theor. Comput. Sci., 2007

On the existence of prime decompositions.

Yo-Sub Han, Arto Salomaa, Kai Salomaa, Derick Wood, Sheng Yu

Theor. Comput. Sci., 2007

Simple-Regular Expressions and Languages.

Yo-Sub Han, Gerhard Trippen, Derick Wood

J. Autom. Lang. Comb., 2007

Outfix-Free Regular Languages and Prime Outfix-Free Decomposition.

Yo-Sub Han, Derick Wood

Fundam. Informaticae, 2007

Intercode Regular Languages.

Yo-Sub Han, Kai Salomaa, Derick Wood

Fundam. Informaticae, 2007

Decision Algorithms for Subfamilies of Regular Languages using State-Pair Graphs.

Yo-Sub Han

Bull. EATCS, 2007

Generalizations of One-Deterministic Regular Languages.

Yo-Sub Han, Derick Wood

Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2006

Infix-free Regular Expressions and Languages.

Yo-Sub Han, Yajun Wang, Derick Wood

Int. J. Found. Comput. Sci., 2006

Prime Decompositions of Regular Languages.

Yo-Sub Han, Kai Salomaa, Derick Wood

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

State Complexity of Prefix-Free Regular Languages.

Yo-Sub Han, Kai Salomaa, Derick Wood

Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

Overlap-Free Regular Languages.

Yo-Sub Han, Derick Wood

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

The generalization of generalized automata: expression automata.

Yo-Sub Han, Derick Wood

Int. J. Found. Comput. Sci., 2005

Shorter Regular Expressions from Finite-State Automata.

Yo-Sub Han, Derick Wood

Proceedings of the Implementation and Application of Automata, 2005

A New Linearizing Restriction in the Pattern Matching Problem.

Yo-Sub Han, Derick Wood

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

Prefix-Free Regular-Expression Matching.

Yo-Sub Han, Yajun Wang, Derick Wood

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005