( en | de | ru )

 

Disambiguation of "Eom, Hae-Sung"

Author of the publication

copydeleteadd this publication to your clipboard
State Complexity of Combined Operations for Prefix-Free Regular Languages.

, , , and . Discrete Mathematics and Computer Science, page 137-151. The Publishing House of the Romanian Academy, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sung-Hae Cho

Jeehyeon Eom

Seon-Ae Eom

Dji-In Gina Eom

-hae Yu

 

Other publications of authors with the same name

State complexity of combined operations for suffix-free regular languages., and . Theor. Comput. Sci., (2013)Operational State Complexity of Subtree-Free Regular Tree Languages., , and . Int. J. Found. Comput. Sci., 27 (6): 705-724 (2016)State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages., , and . DCFS, volume 8031 of Lecture Notes in Computer Science, page 78-89. Springer, (2013)A recommendation system based on a subset of raters., , , , and . ICUIMC, page 99:1-99:9. ACM, (2012)Analyzing category correlations for recommendation system., , , , and . ICUIMC, page 1. ACM, (2011)State Complexity of Combined Operations for Prefix-Free Regular Languages., , , and . Discrete Mathematics and Computer Science, page 137-151. The Publishing House of the Romanian Academy, (2014)A Smart Movie Recommendation System., , , , , , and . HCI (11), volume 6771 of Lecture Notes in Computer Science, page 558-566. Springer, (2011)Combined operations on prefix-free and suffix-free languages., and . NCMA, volume 321 of books@ocg.at, page 147-162. Österreichische Computer Gesellschaft, (2016)State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages., , and . Int. J. Found. Comput. Sci., 26 (2): 211-228 (2015)State Complexity of Basic Operations on Non-returning Regular Languages., , and . DCFS, volume 8031 of Lecture Notes in Computer Science, page 54-65. Springer, (2013)