Yo-Sub Han

According to our database1, Yo-Sub Han
  • authored at least 119 papers between 2004 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Nondeterministic seedless oritatami systems and hardness of testing their equivalence.
Natural Computing, 2018

Growth Rate of Minimum Branching.
Journal of Automata, Languages and Combinatorics, 2018

2017
Outfix-guided insertion.
Theor. Comput. Sci., 2017

Pseudoknot-generating operation.
Theor. Comput. Sci., 2017

State complexity of permutation on finite languages over a binary alphabet.
Theor. Comput. Sci., 2017

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

State Complexity of k-Parallel Tree Concatenation.
Fundam. Inform., 2017

Outfix-guided insertion.
CoRR, 2017

Ambiguity, Nondeterminism and State Complexity of Finite Automata.
Acta Cybern., 2017

Alignment Distance of Regular Tree Languages.
Proceedings of the Implementation and Application of Automata, 2017

Deduplication on Finite Automata and Nested Duplication Systems.
Proceedings of the Unconventional Computation and Natural Computation, 2017

Edit-Distance Between Visibly Pushdown Languages.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Consensus String Problem for Multiple Regular Languages.
Proceedings of the Language and Automata Theory and Applications, 2017

Template-Based Pattern Matching in Two-Dimensional Arrays.
Proceedings of the Combinatorial Image Analysis - 18th International Workshop, 2017

Ruleset Optimization on Isomorphic Oritatami Systems.
Proceedings of the DNA Computing and Molecular Programming - 23rd International Conference, 2017

Self-attraction Removal from Oritatami Systems.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016
State complexity of inversion operations.
Theor. Comput. Sci., 2016

Pseudo-inversion: closure properties and decidability.
Natural Computing, 2016

Duplications and Pseudo-Duplications.
IJUC, 2016

State Complexity of Regular Tree Languages for Tree Matching.
Int. J. Found. Comput. Sci., 2016

Operational State Complexity of Subtree-Free Regular Tree Languages.
Int. J. Found. Comput. Sci., 2016

State Complexity of Insertion.
Int. J. Found. Comput. Sci., 2016

Approximate matching between a context-free grammar and a finite-state automaton.
Inf. Comput., 2016

State Complexity of Basic Operations on Non-Returning Regular Languages.
Fundam. Inform., 2016

OMPPM: online multiple palindrome pattern matching.
Bioinformatics, 2016

State complexity of deletion and bipolar deletion.
Acta Inf., 2016

Pseudoknot-Generating Operation.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Inferring a Relax NG Schema from XML Documents.
Proceedings of the Language and Automata Theory and Applications, 2016

Nondeterministic Seedless Oritatami Systems and Hardness of Testing Their Equivalence.
Proceedings of the DNA Computing and Molecular Programming - 22nd International Conference, 2016

Outfix-Guided Insertion - (Extended Abstract).
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015
Non-overlapping inversion on strings and languages.
Theor. Comput. Sci., 2015

Alignment with non-overlapping inversions and translocations on two strings.
Theor. Comput. Sci., 2015

State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages.
Int. J. Found. Comput. Sci., 2015

State Complexity of Boundary of Prefix-Free Regular Languages.
Int. J. Found. Comput. Sci., 2015

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

State Complexity of Kleene-Star Operations on Regular Tree Languages.
Acta Cybern., 2015

Duplications and Pseudo-Duplications.
Proceedings of the Unconventional Computation and Natural Computation, 2015

Frequent Pattern Mining with Non-overlapping Inversions.
Proceedings of the Language and Automata Theory and Applications, 2015

Generalizations of Code Languages with Marginal Errors.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

The State Complexity of Permutations on Finite Languages over Binary Alphabets.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014
Decidability of involution hypercodes.
Theor. Comput. Sci., 2014

A Speculative Parallel DFA Membership Test for Multicore, SIMD and Cloud Computing Environments.
International Journal of Parallel Programming, 2014

Left is Better than Right for Reducing Nondeterminism of NFAs.
Proceedings of the Implementation and Application of Automata, 2014

Alignment with Non-overlapping Inversions on Two Strings.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Pseudo-inversion on Formal Languages.
Proceedings of the Unconventional Computation and Natural Computation, 2014

Online Multiple Palindrome Pattern Matching.
Proceedings of the String Processing and Information Retrieval, 2014

Parallel CYK Membership Test on GPUs.
Proceedings of the Network and Parallel Computing, 2014

Top-Down Tree Edit-Distance of Regular Tree Languages.
Proceedings of the Language and Automata Theory and Applications, 2014

Analyzing Item Features for Cold-Start Problems in Recommendation Systems.
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.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

State Complexity of Deletion.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

State Complexity of Regular Tree Languages for Tree Pattern Matching.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

State Complexity of Inversion Operations.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

State Complexity of Combined Operations for Prefix-Free Regular Languages.
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.
Theor. Comput. Sci., 2013

The Edit-Distance between a Regular Language and a Context-Free Language.
Int. J. Found. Comput. Sci., 2013

An Improved Prefix-Free Regular-Expression Matching.
Int. J. Found. Comput. Sci., 2013

State Elimination Heuristics for Short Regular Expressions.
Fundam. Inform., 2013

Representative reviewers for Internet social media.
Expert Syst. Appl., 2013

Approximate Matching between a Context-Free Grammar and a Finite-State Automaton.
Proceedings of the Implementation and Application of Automata, 2013

Identifying representative ratings for a new item in recommendation system.
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.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

State Complexity of Subtree-Free Regular Tree Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

State Complexity of Basic Operations on Non-returning Regular Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012
Analysis of a cellular automaton model for car traffic with a junction.
Theor. Comput. Sci., 2012

A movie recommendation algorithm based on genre correlations.
Expert Syst. Appl., 2012

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

Computing User Reputation in a Social Network of Web 2.0.
Computing and Informatics, 2012

A recommendation system based on a subset of raters.
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.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
Overlap-Free Languages and solid Codes.
Int. J. Found. Comput. Sci., 2011

A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule.
Proceedings of the Implementation and Application of Automata, 2011

Analyzing category correlations for recommendation system.
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, 2011

A Smart Movie Recommendation System.
Proceedings of the Human Interface and the Management of Information. Interacting with Information, 2011

Generalized One-Unambiguity.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010
On the Linear Number of Matching Substrings.
J. UCS, 2010

Nondeterministic State Complexity for Suffix-Free Regular Languages
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Identifying Representative Reviewers in Internet Social Media.
Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2010

2009
Considering Resource Management in Agent-Based Virtual Organization.
Proceedings of the Intelligent Agents in the Evolution of Web and Applications, 2009

Nondeterministic state complexity of nested word automata.
Theor. Comput. Sci., 2009

State complexity of basic operations on suffix-free regular languages.
Theor. Comput. Sci., 2009

Adaptability in an agent-based virtual organisation.
IJAOSE, 2009

Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages.
Fundam. Inform., 2009

Implementation of State Elimination Using Heuristics.
Proceedings of the Implementation and Application of Automata, 2009

State Complexity of Combined Operations for Prefix-Free Regular Languages.
Proceedings of the Language and Automata Theory and Applications, 2009

Evaluation of User Reputation on YouTube.
Proceedings of the Online Communities and Social Computing, 2009

User Reputation Evaluation Using Co-occurrence Feature and Collective Intelligence.
Proceedings of the Online Communities and Social Computing, 2009

Operational State Complexity of Prefix-Free Regular Languages.
Proceedings of the Automata, Formal Languages, and Related Topics, 2009

2008
State Complexity of Union and Intersection of Finite Languages.
Int. J. Found. Comput. Sci., 2008

Generalizations of 1-deterministic regular languages.
Inf. Comput., 2008

Generic Framework for Agent Adaptability and Utilization in a Virtual Organization - Preliminary Considerations.
Proceedings of the WEBIST 2008, 2008

Adaptability in an Agent-Based Virtual Organization - Towards Implementation.
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.
Proceedings of the Agent and Multi-Agent Systems: Technologies and Applications, 2008

Ontological matchmaking in a Duty Trip Support application in a virtual organization.
Proceedings of the International Multiconference on Computer Science and Information Technology, 2008

Infrastructure for Ontological Resource Matching in a Virtual Organization.
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.
Proceedings of the Third IEEE International Conference on Digital Information Management (ICDIM), 2008

On Resource Profiling and Matching in an Agent-Based Virtual Organization.
Proceedings of the Artificial Intelligence and Soft Computing, 2008

Generic Framework for Agent Adaptability and Utilization in a Virtual Organization - Preliminary Considerations.
Proceedings of the ENASE 2008, 2008

2007
Prefix-free regular languages and pattern matching.
Theor. Comput. Sci., 2007

Obtaining shorter regular expressions from finite-state automata.
Theor. Comput. Sci., 2007

On the existence of prime decompositions.
Theor. Comput. Sci., 2007

Simple-Regular Expressions and Languages.
Journal of Automata, Languages and Combinatorics, 2007

Outfix-Free Regular Languages and Prime Outfix-Free Decomposition.
Fundam. Inform., 2007

Intercode Regular Languages.
Fundam. Inform., 2007

Decision Algorithms for Subfamilies of Regular Languages using State-Pair Graphs.
Bulletin of the EATCS, 2007

State Complexity of Basic Operations on Suffix-Free Regular Languages.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Generalizations of One-Deterministic Regular Languages.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

State Complexity of Union and Intersection of Finite Languages.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006
Infix-free Regular Expressions and Languages.
Int. J. Found. Comput. Sci., 2006

Prime Decompositions of Regular Languages.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

State Complexity of Prefix-Free Regular Languages.
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.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005
The generalization of generalized automata: expression automata.
Int. J. Found. Comput. Sci., 2005

Shorter Regular Expressions from Finite-State Automata.
Proceedings of the Implementation and Application of Automata, 2005

Outfix-Free Regular Languages and Prime Outfix-Free Decomposition.
Proceedings of the Theoretical Aspects of Computing, 2005

A New Linearizing Restriction in the Pattern Matching Problem.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

Simple-Regular Expressions and Languages.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

Prefix-Free Regular-Expression Matching.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004
The Generalization of Generalized Automata: Expression Automata.
Proceedings of the Implementation and Application of Automata, 2004


  Loading...