52 citations · 114 across the 22 of their papers we have counts for
Showing 2014 · cs.LOShow all
2 papers · 2 filters
cs.LO2014
Deciding the Borel complexity of regular tree languages
Alessandro Facchini, Henryk Michalewski
We show that it is decidable whether a given a regular tree language belongs to the class of the Borel hierarchy, or equivalently whether the Wadge degree of a regula…
cs.LO2014★ 2 cited
Weak MSO: Automata and Expressiveness Modulo Bisimilarity
Facundo Carreiro, Alessandro Facchini, Yde Venema +1
We prove that the bisimulation-invariant fragment of weak monadic second-order logic (WMSO) is equivalent to the fragment of the modal -calculus where the application of the lea…