Sang-Ki Ko, Hae-Sung Eom, Yo-Sub Han. Operational State Complexity of Subtree-Free Regular Tree Languages. Int. J. Found. Comput. Sci., 27(6):705-724, 2016. [doi]
@article{KoEH16,
title = {Operational State Complexity of Subtree-Free Regular Tree Languages},
author = {Sang-Ki Ko and Hae-Sung Eom and Yo-Sub Han},
year = {2016},
doi = {10.1142/S0129054116500246},
url = {http://dx.doi.org/10.1142/S0129054116500246},
researchr = {https://researchr.org/publication/KoEH16},
cites = {0},
citedby = {0},
journal = {Int. J. Found. Comput. Sci.},
volume = {27},
number = {6},
pages = {705-724},
}