• 694 Citations
  • 13 h-Index
20052019
If you made any changes in Pure these will be visible here soon.

Research Output 2005 2019

Filter
Article
2019

Alignment distance of regular tree languages

Han, Y-S. & Ko, S. K., 2019 Oct 1, In : Theoretical Computer Science. 787, p. 127-137 11 p.

Research output: Contribution to journalArticle

Alignment
Maximum Degree
Bioinformatics
XML
Tree Automata

Bound-decreasing duplication system

Cho, D. J., Han, Y-S. & Kim, H., 2019 Jan 1, In : Theoretical Computer Science.

Research output: Contribution to journalArticle

Finite automata
Duplication
Finite State Automata
Strings
Formal languages

Ruleset optimization on isomorphic oritatami systems

Han, Y-S. & Kim, H., 2019 Jan 1, In : Theoretical Computer Science.

Research output: Contribution to journalArticle

Folding
Hardness
Fold
Isomorphic
RNA

Site-directed insertion: Language equations and decision problems

Cho, D. J., Han, Y-S., Salomaa, K. & Smith, T. J., 2019 Jan 1, In : Theoretical Computer Science.

Research output: Contribution to journalArticle

Decision problem
Insertion
Semantics
Trajectories
Overlapping
2018
1 Citation (Scopus)

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

Lee, H. S., Lee, H. R., Park, J. U. & Han, Y-S., 2018 Sep 1, In : Decision Support Systems. 113, p. 22-31 10 p.

Research output: Contribution to journalArticle

Unsupervised learning
Language
Learning
Social Networking
Social Work

Growth rate of minimum branching

Palioudakis, A., Han, Y-S. & Salomaa, K., 2018 Jan 1, In : Journal of Automata, Languages and Combinatorics. 23, 1-3, p. 281-292 12 p.

Research output: Contribution to journalArticle

Finite automata
Branching
Nondeterminism
Finite Automata
7 Citations (Scopus)

Nondeterministic seedless oritatami systems and hardness of testing their equivalence

Han, Y-S., Kim, H., Ota, M. & Seki, S., 2018 Mar 1, In : Natural Computing. 17, 1, p. 67-79 13 p.

Research output: Contribution to journalArticle

RNA
Conformations
Hardness
Testing
Turing machines
2017
7 Citations (Scopus)

Ambiguity, nondeterminism and state complexity of finite automata

Han, Y-S., Salomaa, A. & Salomaa, K., 2017 Jan 1, In : Acta Cybernetica. 23, 1, p. 141-157 17 p.

Research output: Contribution to journalArticle

State Complexity
Nondeterminism
Finite Automata
Finite automata
Counting
47 Citations (Scopus)

Critical care admission following elective surgery was not associated with survival benefit: prospective analysis of data from 27 countries

Kahan, B. C., Koulenti, D., Arvaniti, K., Beavis, V., Campbell, D., Chan, M., Moreno, R., Pearse, R. M., Pearse, R. M., Beattie, S., Clavien, P-A., Demartines, N., Fleisher, L. A., Grocott, M., Haddow, J., Hoeft, A., Holt, P., Moreno, R., Pritchard, N., Rhodes, A. & 30 others, Wijeysundera, D., Wilson, M., Ahmed, T., Everingham, K., Hewson, R., Januszewska, M., Pearse, R. M., Phull, M-K., Lee, E., Choi, S., Chen, C., Han, Y., Yang, S., Han, K., Chen, C., Chu, S., Chung, C. K. E., Lee, C., Lee, Y. C., Lee, H. S., Lee, J. M., Choi, H-MD., Kim, C. J., Kim, S., Park, K., Chang, Y. H., Chang, J., Lee, C., Lee, G. & Kim, T., 2017, In : Intensive Care Medicine. 43, 7

Research output: Contribution to journalArticle

Critical Care
Survival
Mortality
Logistic Models
Perioperative Care
3 Citations (Scopus)

Outfix-guided insertion

Cho, D. J., Han, Y-S., Ng, T. & Salomaa, K., 2017 Nov 21, In : Theoretical Computer Science. 701, p. 70-84 15 p.

Research output: Contribution to journalArticle

Finite automata
Insertion
Context free languages
DNA
Polynomials

Pseudoknot-generating operation

Cho, D. J., Han, Y. S., Ng, T. & Salomaa, K., 2017 Oct 5, In : Theoretical Computer Science. 696, p. 52-64 13 p.

Research output: Contribution to journalArticle

Formal languages
Regular Languages
Strings
Context free languages
Deterministic Finite Automata

State complexity of k-parallel tree concatenation

Han, Y-S., Ko, S. K. & Salomaa, K., 2017 Jan 1, In : Fundamenta Informaticae. 154, 1-4, p. 185-199 15 p.

Research output: Contribution to journalArticle

State Complexity
Concatenation
Tree Automata
Upper bound
Lower bound
2 Citations (Scopus)

State complexity of permutation on finite languages over a binary alphabet

Cho, D. J., Goč, D., Han, Y-S., Ko, S. K., Palioudakis, A. & Salomaa, K., 2017 Jun 19, In : Theoretical Computer Science. 682, p. 67-78 12 p.

Research output: Contribution to journalArticle

State Complexity
Deterministic Finite Automata
Finite automata
Permutation
Strings
2016
6 Citations (Scopus)

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

Ko, S. K., Han, Y-S. & Salomaa, K., 2016 Apr 1, In : Information and Computation. 247, p. 278-289 12 p.

Research output: Contribution to journalArticle

Context free grammars
Finite State Automata
Edit Distance
Context-free Grammar
Finite automata
3 Citations (Scopus)

Duplications and pseudo-duplications

Cho, D. J., Han, Y. S., Kim, H., Palioudakis, A. & Salomaa, K., 2016 Jan 1, In : International Journal of Unconventional Computing. 12, 2-3, p. 145-167 23 p.

Research output: Contribution to journalArticle

Formal languages
Context sensitive languages
Context free languages
Copying
Finite automata

OMPPM: Online multiple palindrome pattern matching

Kim, H. & Han, Y-S., 2016 Apr 15, In : Bioinformatics. 32, 8, p. 1151-1157 7 p.

Research output: Contribution to journalArticle

Palindrome
Pattern matching
Pattern Matching
Matching Problem
RNA Sequence Analysis
1 Citation (Scopus)

Operational State Complexity of Subtree-Free Regular Tree Languages

Ko, S. K., Eom, H. S. & Han, Y-S., 2016 Sep 1, In : International Journal of Foundations of Computer Science. 27, 6, p. 705-724 20 p.

Research output: Contribution to journalArticle

XML
Stars

Pseudo-inversion: closure properties and decidability

Cho, D. J., Han, Y-S., Kang, S. D., Kim, H., Ko, S. K. & Salomaa, K., 2016 Mar 1, In : Natural Computing. 15, 1, p. 31-39 9 p.

Research output: Contribution to journalArticle

Context free languages
Computability and decidability
Formal languages
DNA sequences
Polynomials
7 Citations (Scopus)

State Complexity of Basic Operations on Non-Returning Regular Languages

Eom, H. S., Han, Y-S. & Jirásková, G., 2016 Mar 4, In : Fundamenta Informaticae. 144, 2, p. 161-182 22 p.

Research output: Contribution to journalArticle

State Complexity
Formal languages
Regular Languages
Boolean Operation
Suffix
5 Citations (Scopus)

State complexity of deletion and bipolar deletion

Han, Y-S., Ko, S. K. & Salomaa, K., 2016 Feb 1, In : Acta Informatica. 53, 1, p. 67-85 19 p.

Research output: Contribution to journalArticle

Formal languages
Finite automata
5 Citations (Scopus)

State complexity of insertion

Han, Y-S., Ko, S. K., Ng, T. & Salomaa, K., 2016 Nov 1, In : International Journal of Foundations of Computer Science. 27, 7, p. 863-878 16 p.

Research output: Contribution to journalArticle

Formal languages
Finite automata
2 Citations (Scopus)

State complexity of inversion operations

Cho, D. J., Han, Y. S., Ko, S. K. & Salomaa, K., 2016 Jan 11, In : Theoretical Computer Science. 610, p. 2-12 11 p.

Research output: Contribution to journalArticle

State Complexity
Inversion
Prefix
Strings
Reversal
1 Citation (Scopus)

State Complexity of Regular Tree Languages for Tree Matching

Ko, S. K., Lee, H. R. & Han, Y-S., 2016 Dec 1, In : International Journal of Foundations of Computer Science. 27, 8, p. 965-979 15 p.

Research output: Contribution to journalArticle

2015
9 Citations (Scopus)

Alignment with non-overlapping inversions and translocations on two strings

Cho, D. J., Han, Y-S. & Kim, H., 2015 Jan 1, In : Theoretical Computer Science. 575, 1, p. 90-101 12 p.

Research output: Contribution to journalArticle

Translocation
Inversion
Alignment
Strings
Sequence Alignment
7 Citations (Scopus)

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

Choi, S. M., Lee, H., Han, Y-S., Man, K. L. & Chong, W. K., 2015 Jan 1, In : International Journal of Distributed Sensor Networks. 2015, 475163.

Research output: Contribution to journalArticle

Marketing
Recommender systems
Internet of things
Communication
1 Citation (Scopus)

Non-overlapping inversion on strings and languages

Kim, H. & Han, Y-S., 2015 Aug 9, In : Theoretical Computer Science. 592, p. 9-22 14 p.

Research output: Contribution to journalArticle

Context sensitive languages
Context free languages
Computability and decidability
Inversion
Strings
2 Citations (Scopus)

State Complexity of Boundary of Prefix-Free Regular Languages

Eom, H. S. & Han, Y-S., 2015 Jan 1, In : International Journal of Foundations of Computer Science. 26, 6, p. 697-707 11 p.

Research output: Contribution to journalArticle

Formal languages
Structural properties
Chemical analysis
1 Citation (Scopus)

State complexity of Kleene-star operations on regular tree languages

Han, Y-S., Ko, S. K., Piao, X. & Salomaa, K., 2015 Jan 1, In : Acta Cybernetica. 22, 2, p. 403-422 20 p.

Research output: Contribution to journalArticle

Star Operation
State Complexity
Concatenation
Stars
Star
1 Citation (Scopus)

State complexity of k-union and k-intersection for prefix-free regular languages

Eom, H. S., Han, Y. S. & Salomaa, K., 2015 Jan 1, In : International Journal of Foundations of Computer Science. 26, 2, p. 211-227 17 p.

Research output: Contribution to journalArticle

Formal languages
Finite automata
Structural properties
2014
7 Citations (Scopus)

A speculative parallel DFA membership test for Multicore, Simd and cloud computing environments

Ko, Y., Jung, M., Han, Y-S. & Burgstaller, B., 2014 Jan 1, In : International Journal of Parallel Programming. 42, 3, p. 456-489 34 p.

Research output: Contribution to journalArticle

Deterministic Finite Automata
Finite automata
Cloud computing
Cloud Computing
Regular Expressions
1 Citation (Scopus)

Decidability of involution hypercodes

Cho, D. J., Han, Y-S. & Ko, S. K., 2014 Jan 1, In : Theoretical Computer Science. 550, C, p. 90-99 10 p.

Research output: Contribution to journalArticle

Computability and decidability
Decidability
Involution
Context free languages
Formal languages
2013
1 Citation (Scopus)

An improved prefix-free regular-expression matching

Han, Y-S., 2013 Aug 1, In : International Journal of Foundations of Computer Science. 24, 5, p. 679-687 9 p.

Research output: Contribution to journalArticle

17 Citations (Scopus)

Representative reviewers for Internet social media

Choi, S. M. & Han, Y-S., 2013 Jan 1, In : Expert Systems with Applications. 40, 4, p. 1274-1282 9 p.

Research output: Contribution to journalArticle

Internet
Marketing
3 Citations (Scopus)

State complexity of combined operations for suffix-free regular languages

Eom, H. S. & Han, Y-S., 2013 Oct 28, In : Theoretical Computer Science. 510, p. 87-93 7 p.

Research output: Contribution to journalArticle

State Complexity
Suffix
Formal languages
Regular Languages
Stars
3 Citations (Scopus)

State elimination heuristics for short regular expressions

Han, Y-S., 2013 Nov 25, In : Fundamenta Informaticae. 128, 4, p. 445-462 18 p.

Research output: Contribution to journalArticle

Regular Expressions
Finite automata
Elimination
Heuristics
Finite State Automata
13 Citations (Scopus)

The edit-distance between a regular language and a context-free language

Han, Y-S., Ko, S. K. & Salomaa, K., 2013 Nov 1, In : International Journal of Foundations of Computer Science. 24, 7, p. 1067-1082 16 p.

Research output: Contribution to journalArticle

Context free languages
Formal languages
Finite automata
Polynomials
2012
57 Citations (Scopus)

A movie recommendation algorithm based on genre correlations

Choi, S. M., Ko, S. K. & Han, Y-S., 2012 Jul 1, In : Expert Systems with Applications. 39, 9, p. 8079-8085 7 p.

Research output: Contribution to journalArticle

Recommender systems
Collaborative filtering
Internet
14 Citations (Scopus)

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

Han, Y-S. & Ko, S. K., 2012 Sep 7, In : Theoretical Computer Science. 450, p. 54-67 14 p.

Research output: Contribution to journalArticle

Cellular Automaton Model
Cellular automata
Railroad cars
Traffic
Traffic Flow
10 Citations (Scopus)

Computing user reputation in a social network of web 2.0

Han, Y-S., Laehyun, K. I. M. & Jeong-Won, C. H. A., 2012 Jun 25, In : Computing and Informatics. 31, 2, p. 447-462 16 p.

Research output: Contribution to journalArticle

Metadata
Websites
Experiments
2011
1 Citation (Scopus)

Overlap-free languages and solid codes

Han, Y-S. & Salomaa, K., 2011 Aug 1, In : International Journal of Foundations of Computer Science. 22, 5, p. 1197-1209 13 p.

Research output: Contribution to journalArticle

Formal languages
Computability and decidability
Decomposition
Context free languages
Data communication systems
2010
2 Citations (Scopus)

On the linear number of matching substrings

Han, Y. S., 2010 May 21, In : Journal of Universal Computer Science. 16, 5, p. 715-728 14 p.

Research output: Contribution to journalArticle

Pattern matching
Semantics
Restriction
Regular Expressions
Pattern Matching
2009
2 Citations (Scopus)

Adaptability in an agent-based virtual organisation

Frackowiak, G., Ganzha, M., Gawinecki, M., Paprzycki, M., Szymczak, M., Bǎdicǎ, C., Han, Y-S. & Park, M. W., 2009 Jan 1, In : International Journal of Agent-Oriented Software Engineering. 3, 2-3, p. 188-211 24 p.

Research output: Contribution to journalArticle

Personnel
31 Citations (Scopus)

Nondeterministic state complexity of basic operations for prefix-free regular languages

Han, Y. S., Salomaa, K. & Wood, D., 2009 Mar 9, In : Fundamenta Informaticae. 90, 1-2, p. 93-106 14 p.

Research output: Contribution to journalArticle

Prefix-free
State Complexity
Formal languages
Regular Languages
Finite automata
20 Citations (Scopus)

Nondeterministic state complexity of nested word automata

Han, Y-S. & Salomaa, K., 2009 Aug 20, In : Theoretical Computer Science. 410, 30-32, p. 2961-2971 11 p.

Research output: Contribution to journalArticle

State Complexity
Formal languages
Finite automata
Automata
Lower bound
50 Citations (Scopus)

State complexity of basic operations on suffix-free regular languages

Han, Y-S. & Salomaa, K., 2009 Jun 28, In : Theoretical Computer Science. 410, 27-29, p. 2537-2548 12 p.

Research output: Contribution to journalArticle

State Complexity
Suffix
Formal languages
Regular Languages
Boolean Operation
2008
8 Citations (Scopus)

Generalizations of 1-deterministic regular languages

Han, Y-S. & Wood, D., 2008 Sep 1, In : Information and Computation. 206, 9-10, p. 1117-1125 9 p.

Research output: Contribution to journalArticle

Determinism
Formal languages
Look-ahead
Regular Languages
XML
20 Citations (Scopus)

State complexity of union and intersection of finite languages

Han, Y-S. & Salomaa, K., 2008 Jun 1, In : International Journal of Foundations of Computer Science. 19, 3, p. 581-595 15 p.

Research output: Contribution to journalArticle

Finite automata
Structural properties
2007
5 Citations (Scopus)

Intercode regular languages

Han, Y-S., Salomaa, K. & Wood, D., 2007 Mar 14, In : Fundamenta Informaticae. 76, 1-2, p. 113-128 16 p.

Research output: Contribution to journalArticle

Formal languages
Regular Languages
Finite State Automata
Decompose
Finite automata
30 Citations (Scopus)

Obtaining shorter regular expressions from finite-state automata

Han, Y-S. & Wood, D., 2007 Feb 12, In : Theoretical Computer Science. 370, 1-3, p. 110-120 11 p.

Research output: Contribution to journalArticle

Finite State Automata
Regular Expressions
Finite automata
Elimination
Eliminate
14 Citations (Scopus)

On the existence of prime decompositions

Han, Y-S., Salomaa, A., Salomaa, K., Wood, D. & Yu, S., 2007 May 10, In : Theoretical Computer Science. 376, 1-2, p. 60-69 10 p.

Research output: Contribution to journalArticle

Formal languages
Decomposition
Factorization
Decompose
Regular Languages