On the Topological Complexity of Weakly Recognizable Tree Languages

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]

Abstract

Abstract is missing.