Jacques Duparc, Filip Murlak. On the Topological Complexity of Weakly Recognizable Tree Languages. In Erzsébet Csuhaj-Varjú, Zoltán Ésik, editors, Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings. Volume 4639 of Lecture Notes in Computer Science, pages 261-273, Springer, 2007. [doi]
@inproceedings{DuparcM07,
title = {On the Topological Complexity of Weakly Recognizable Tree Languages},
author = {Jacques Duparc and Filip Murlak},
year = {2007},
doi = {10.1007/978-3-540-74240-1_23},
url = {http://dx.doi.org/10.1007/978-3-540-74240-1_23},
researchr = {https://researchr.org/publication/DuparcM07},
cites = {0},
citedby = {0},
pages = {261-273},
booktitle = {Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings},
editor = {Erzsébet Csuhaj-Varjú and Zoltán Ésik},
volume = {4639},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-74239-5},
}