%0 Conference Paper %1 conf/cie/FacchiniM14 %A Facchini, Alessandro %A Michalewski, Henryk %B CiE %D 2014 %E Beckmann, Arnold %E Csuhaj-Varjú, Erzsébet %E Meer, Klaus %I Springer %K dblp %P 163-172 %T Deciding the Borel Complexity of Regular Tree Languages. %U http://dblp.uni-trier.de/db/conf/cie/cie2014.html#FacchiniM14 %V 8493 %@ 978-3-319-08018-5

@inproceedings{conf/cie/FacchiniM14, added-at = {2017-09-16T00:00:00.000+0200}, author = {Facchini, Alessandro and Michalewski, Henryk}, biburl = {https://www.bibsonomy.org/bibtex/2d3001e015d6cb1a9cf07feb417c76d4a/dblp}, booktitle = {CiE}, crossref = {conf/cie/2014}, editor = {Beckmann, Arnold and Csuhaj-Varjú, Erzsébet and Meer, Klaus}, ee = {https://doi.org/10.1007/978-3-319-08019-2_17}, interhash = {230360b7baf4f26d510e0f82859a4e9e}, intrahash = {d3001e015d6cb1a9cf07feb417c76d4a}, isbn = {978-3-319-08018-5}, keywords = {dblp}, pages = {163-172}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T17:08:51.000+0200}, title = {Deciding the Borel Complexity of Regular Tree Languages.}, url = {http://dblp.uni-trier.de/db/conf/cie/cie2014.html#FacchiniM14}, volume = 8493, year = 2014 }