- Fundamenta Informaticae 81 (2007) 441457 441 Outfix-Free Regular Languages and Prime Outfix-Free
- Bulletin of the EATCS no 93, pp. 118133, October 2007 c European Association for Theoretical Computer Science
- HKUSTTheoreticalComputerScienceCenterResearchReportHKUST-TCSC-2005-05 Simple-Regular Expressions and Languages
- A New Linearizing Restriction in the Pattern Matching Problem
- Approximate a Minimum-Diameter Spanning Tree with Bounded Hee-Kap Ahny
- Theoretical Computer Science 389 (2007) 307317 www.elsevier.com/locate/tcs
- Theoretical Computer Science 376 (2007) 6069 www.elsevier.com/locate/tcs
- On the Linear Number of Matching Substrings Yo-Sub Han1
- A.A. Ozok and P. Zaphiris (Eds.): Online Communities, LNCS 5621, pp. 346353, 2009. Springer-Verlag Berlin Heidelberg 2009
- Shorter Regular Expressions from Finite-State Yo-Sub Han and Derick Wood
- Outfix-Free Regular Languages and Prime Outfix-Free Decomposition
- Prime Decompositions of Regular Languages Yo-Sub Han1
- Theoretical Computer Science 410 (2009) 29612971 Contents lists available at ScienceDirect
- Theoretical Computer Science 410 (2009) 25372548 Contents lists available at ScienceDirect
- Fundamenta Informaticae 90 (2009) 93106 93 DOI 10.3233/FI-2009-0008
- Theoretical Computer Science 370 (2007) 110120 www.elsevier.com/locate/tcs
- Fundamenta Informaticae 76 (2007) 113128 113 Intercode Regular Languages
- Identifying Representative Reviewers in Internet Social Media
- A Content Recommendation System Based on Category Correlations Sang-Min Choi
- Implementation of State Elimination Using Jae-Hee Ahn1
- State Complexity of Combined Operations for Prefix-Free Regular Languages
- A.A. Ozok and P. Zaphiris (Eds.): Online Communities, LNCS 5621, pp. 305311, 2009. Springer-Verlag Berlin Heidelberg 2009
- On Resource Profiling and Matching in an Agent-Based Virtual Organization
- Adaptive Information Provisioning in an Agent-Based Virtual Organization--Ontologies
- State Complexity of Basic Operations on Suffix-Free Regular Languages
- State Complexity of Union and Intersection of Finite Languages
- Overlap-Free Regular Languages Yo-Sub Han1,
- HKUSTTheoreticalComputerScienceCenterResearchReportHKUST-TCSC-2006-02 State Complexity of Prefix-Free Regular Languages
- Prefix-Free Regular-Expression Matching Yo-Sub Han, Yajun Wang, and Derick Wood
- The Generalization of Generalized Automata: Expression Automata
- I. McQuillan and G. Pighizzini (Eds.): 12th International Workshop on Descriptional Complexity of Formal Systems (DCFS 2010)
- Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 181194 c Otto-von-Guericke-Universitat Magdeburg
- Analyzing Category Correlations for Recommendation Bernhard Scholz
- Information and Computation 206 (2008) 11171125 Contents lists available at ScienceDirect
- International Journal of Foundations of Computer Science %%R. ... , . Vol. 19, No. 3 (2008) 581-595 V World Scientific
- Generalized One-Unambiguity Pascal Caron1
- A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule
- DOI: 10.1142/S0129054111008647 International Journal of Foundations of Computer Science
- M.J. Smith, G. Salvendy (Eds.): Human Interface, Part I, HCII 2011, LNCS 6771, pp. 558566, 2011. Springer-Verlag Berlin Heidelberg 2011
