The following publications are possibly variants of this publication:
- Operational State Complexity of Subtree-Free Regular Tree LanguagesSang-Ki Ko, Hae-Sung Eom, Yo-Sub Han. ijfcs, 27(6):705-724, 2016. [doi]
- State Complexity of Regular Tree Languages for Tree MatchingSang-Ki Ko, Ha-Rim Lee, Yo-Sub Han. ijfcs, 27(8):965-980, 2016. [doi]
- 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 Regular Tree Languages for Tree Pattern MatchingSang-Ki Ko, Ha-Rim Lee, Yo-Sub Han. dcfs 2014: 246-257 [doi]