%0 Journal Article %1 journals/ijfcs/KoEH16 %A Ko, Sang-Ki %A Eom, Hae-Sung %A Han, Yo-Sub %D 2016 %J Int. J. Found. Comput. Sci. %K dblp %N 6 %P 705-724 %T Operational State Complexity of Subtree-Free Regular Tree Languages. %U http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs27.html#KoEH16 %V 27

@article{journals/ijfcs/KoEH16, added-at = {2022-06-23T00:00:00.000+0200}, author = {Ko, Sang-Ki and Eom, Hae-Sung and Han, Yo-Sub}, biburl = {https://www.bibsonomy.org/bibtex/2dbef6a2139eddd2597a95d398778f5b1/dblp}, ee = {https://doi.org/10.1142/S0129054116500246}, interhash = {8adaf1bdb584d8abb2ec10237be18986}, intrahash = {dbef6a2139eddd2597a95d398778f5b1}, journal = {Int. J. Found. Comput. Sci.}, keywords = {dblp}, number = 6, pages = {705-724}, timestamp = {2024-04-09T02:16:51.000+0200}, title = {Operational State Complexity of Subtree-Free Regular Tree Languages.}, url = {http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs27.html#KoEH16}, volume = 27, year = 2016 }