Sciweavers

Share
FCT
2007
Springer

On the Topological Complexity of Weakly Recognizable Tree Languages

9 years 2 months ago
On the Topological Complexity of Weakly Recognizable Tree Languages
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals < ωω , and pseudoexponentiation with the base ω1 of the Wadge degrees. In consequence, the Wadge hierarchy of weakly recognizable tree languages has the height of at least ε0, that is the least fixed point of the exponentiation with the base ω.
Jacques Duparc, Filip Murlak
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where FCT
Authors Jacques Duparc, Filip Murlak
Comments (0)
books