Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

FCT
2007
Springer

favoriteEmaildiscussreport

113views Applied Computing» more FCT 2007»

On the Topological Complexity of Weakly Recognizable Tree Languages

13 years 10 months ago

On the Topological Complexity of Weakly Recognizable Tree Languages

Download www.mimuw.edu.pl

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 ﬁxed point of the exponentiation with the base ω.

Jacques Duparc, Filip Murlak

Real-time Traffic

FCT 2007 | Set Theoretic Operations | Tree Languages | Weak Alternating Automata |

claim paper

Related Content

» Synthesis for Probabilistic Environments

» Weak Derandomization of Weak Algorithms Explicit Versions of Yaos Lemma

» A Topological Approach to Recognition

» A limit process for partial match queries in random quadtrees

» Graph Logics with Rational Relations and the Generalized Intersection Problem

» Fine hierarchies and mreducibilities in theoretical computer science

» A New EliminationBased Data Flow Analysis Framework Using Annotated Decomposition Trees

» Visualizing Evolving Networks Minimum Spanning Trees versus Pathfinder Networks

» Linguistic Facts as Predicates over Ranges of the Sentence

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	FCT
Authors	Jacques Duparc, Filip Murlak

Comments (0)