The following publications are possibly variants of this publication:
- State complexity of basic operations on suffix-free regular languagesYo-Sub Han, Kai Salomaa. TCS, 410(27-29):2537-2548, 2009. [doi]
- State Complexity of Basic Operations on Suffix-Free Regular LanguagesYo-Sub Han, Kai Salomaa. mfcs 2007: 501-512 [doi]
- State Complexity of Combined Operations for Prefix-Free Regular LanguagesYo-Sub Han, Kai Salomaa, Sheng Yu. LATA 2009: 398-409 [doi]
- State Complexity of Combined Operations for Prefix-Free Regular LanguagesHae-Sung Eom, Yo-Sub Han, Kai Salomaa, Sheng Yu. BIRTHDAY 2014: 137-151
- The State Complexities of Some Basic Operations on Regular LanguagesSheng Yu, Qingyu Zhuang, Kai Salomaa. TCS, 125(2):315-328, 1994.
- State Complexity of Boundary of Prefix-Free Regular LanguagesHae-Sung Eom, Yo-Sub Han. ijfcs, 26(6):697-708, 2015. [doi]
- State Complexity of Prefix-Free Regular LanguagesYo-Sub Han, Kai Salomaa, Derick Wood. dcfs 2006: 165-176
- Operational State Complexity of Prefix-Free Regular LanguagesYo-Sub Han, Kai Salomaa, Derick Wood. birthday 2009: 99-115
- State Complexity of Basic Operations on Non-returning Regular LanguagesHae-Sung Eom, Yo-Sub Han, Galina Jirásková. dcfs 2013: 54-65 [doi]
- State Complexity of Basic Operations on Non-Returning Regular LanguagesHae-Sung Eom, Yo-Sub Han, Galina Jirásková. FUIN, 144(2):161-182, 2016. [doi]