Sang-Ki Ko, Ha-Rim Lee, Yo-Sub Han. State Complexity of Regular Tree Languages for Tree Matching. Int. J. Found. Comput. Sci., 27(8):965-980, 2016. [doi]
@article{KoLH16,
title = {State Complexity of Regular Tree Languages for Tree Matching},
author = {Sang-Ki Ko and Ha-Rim Lee and Yo-Sub Han},
year = {2016},
doi = {10.1142/S0129054116500398},
url = {http://dx.doi.org/10.1142/S0129054116500398},
researchr = {https://researchr.org/publication/KoLH16},
cites = {0},
citedby = {0},
journal = {Int. J. Found. Comput. Sci.},
volume = {27},
number = {8},
pages = {965-980},
}