BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Australia
1 × Finland
1 × Germany
1 × Italy
1 × Russia
1 × Taiwan
1 × United Kingdom
2 × Canada
2 × Spain
3 × France
3 × USA
Collaborated with:
K.Salomaa S.Ko D.Wood J.Cha L.Kim J.Ahn D.Cho H.Kim P.Caron L.Mignot S.Yu H.Lee S.Choi H.Eom H.Cho
Talks about:
languag (11) regular (7) general (7) state (7) automata (5) complex (4) finit (4) free (4) express (3) distanc (3)

Person: Yo-Sub Han


Contributed to:

DLT 20152015
LATA 20152015
CIAA 20142014
DLT 20142014
LATA 20142014
CIAA 20132013
DLT 20122012
DLT 20122013
CIAA 20112011
DLT 20112011
HCI/HIMI p1 20112011
CIAA 20092009
LATA 20092009
HCI/OCSC 20092009
DLT 20072007
DLT 20072008
LATA 20072007
DLT 20062006
CIAA 20052005
CIAA 20042004
CIAA 20042005

Wrote 22 papers:

DLT-2015-HanKS #fault
Generalizations of Code Languages with Marginal Errors (YSH, SKK, KS), pp. 264–275.
LATA-2015-ChoHK #mining
Frequent Pattern Mining with Non-overlapping Inversions (DJC, YSH, HK), pp. 121–132.
CIAA-2014-KoH #nondeterminism
Left is Better than Right for Reducing Nondeterminism of NFAs (SKK, YSH), pp. 238–251.
DLT-2014-HanKS #complexity
State Complexity of Deletion (YSH, SKK, KS), pp. 37–48.
LATA-2014-KoHS #top-down
Top-Down Tree Edit-Distance of Regular Tree Languages (SKK, YSH, KS), pp. 466–477.
CIAA-2013-HanKS #approximate #automaton #context-free grammar #finite
Approximate Matching between a Context-Free Grammar and a Finite-State Automaton (YSH, SKK, KS), pp. 146–157.
DLT-2012-HanKS #context-free grammar #regular expression
Computing the Edit-Distance between a Regular Language and a Context-Free Language (YSH, SKK, KS), pp. 85–96.
DLT-J-2012-HanKS13 #context-free grammar #regular expression
The Edit-Distance between a Regular Language and a Context-Free Language (YSH, SKK, KS), pp. 1067–1082.
CIAA-2011-HanK #automaton
A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule (YSH, SKK), pp. 154–165.
Generalized One-Unambiguity (PC, YSH, LM), pp. 129–140.
HIMI-v1-2011-KoCECCKH #recommendation
A Smart Movie Recommendation System (SKK, SMC, HSE, JWC, HC, LK, YSH), pp. 558–566.
CIAA-2009-AhnH #heuristic #implementation #using
Implementation of State Elimination Using Heuristics (JHA, YSH), pp. 178–187.
LATA-2009-HanSY #complexity #regular expression
State Complexity of Combined Operations for Prefix-Free Regular Languages (YSH, KS, SY), pp. 398–409.
OCSC-2009-ChaLHK #evaluation #using
User Reputation Evaluation Using Co-occurrence Feature and Collective Intelligence (JWC, HwL, YSH, LK), pp. 305–311.
OCSC-2009-HanKC #evaluation
Evaluation of User Reputation on YouTube (YSH, LK, JWC), pp. 346–353.
DLT-2007-HanS #complexity #finite
State Complexity of Union and Intersection of Finite Languages (YSH, KS), pp. 217–228.
DLT-J-2007-HanS08 #complexity #finite
State Complexity of Union and Intersection of Finite Languages (YSH, KS), pp. 581–595.
LATA-2007-HanW #regular expression
Generalizations of One-Deterministic Regular Languages (YSH, DW), pp. 273–284.
DLT-2006-HanSW #regular expression
Prime Decompositions of Regular Languages (YSH, KS, DW), pp. 145–155.
CIAA-2005-HanW #automaton #finite #regular expression
Shorter Regular Expressions from Finite-State Automata (YSH, DW), pp. 141–152.
CIAA-2004-HanW #automaton
The Generalization of Generalized Automata: Expression Automata (YSH, DW), pp. 156–166.
CIAA-J-2004-HanW05 #automaton
The generalization of generalized automata: expression automata (YSH, DW), pp. 499–510.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.