Sciweavers

Share
FCT
2007
Springer
9 years 3 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 <...
Jacques Duparc, Filip Murlak
books