Hae-Sung Eom, Yo-Sub Han, Sang-Ki Ko. State Complexity of Subtree-Free Regular Tree Languages. In Helmut Jürgensen, Rogério Reis, editors, Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, London, ON, Canada, July 22-25, 2013. Proceedings. Volume 8031 of Lecture Notes in Computer Science, pages 66-77, Springer, 2013. [doi]
@inproceedings{EomHK13,
title = {State Complexity of Subtree-Free Regular Tree Languages},
author = {Hae-Sung Eom and Yo-Sub Han and Sang-Ki Ko},
year = {2013},
doi = {10.1007/978-3-642-39310-5_8},
url = {http://dx.doi.org/10.1007/978-3-642-39310-5_8},
researchr = {https://researchr.org/publication/EomHK13},
cites = {0},
citedby = {0},
pages = {66-77},
booktitle = {Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, London, ON, Canada, July 22-25, 2013. Proceedings},
editor = {Helmut Jürgensen and Rogério Reis},
volume = {8031},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-39309-9},
}