Deciding the Borel Complexity of Regular Tree Languages

Alessandro Facchini, Henryk Michalewski. Deciding the Borel Complexity of Regular Tree Languages. In Arnold Beckmann, Erzsébet Csuhaj-Varjú, Klaus Meer, editors, Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings. Volume 8493 of Lecture Notes in Computer Science, pages 163-172, Springer, 2014. [doi]

Abstract

Abstract is missing.