Mathematics – Logic
Scientific paper
2009-02-10
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 565-576
Mathematics
Logic
Scientific paper
The game tree languages can be viewed as an automata-theoretic counterpart of parity games on graphs. They witness the strictness of the index hierarchy of alternating tree automata, as well as the fixed-point hierarchy over binary trees. We consider a game tree language of the first non-trivial level, where Eve can force that 0 repeats from some moment on, and its dual, where Adam can force that 1 repeats from some moment on. Both these sets (which amount to one up to an obvious renaming) are complete in the class of co-analytic sets. We show that they cannot be separated by any Borel set, hence {\em a fortiori} by any weakly definable set of trees. This settles a case left open by L.Santocanale and A.Arnold, who have thoroughly investigated the separation property within the $\mu $-calculus and the automata index hierarchies. They showed that separability fails in general for non-deterministic automata of type $\Sigma^{\mu}_{n} $, starting from level $n=3$, while our result settles the missing case $n=2$.
Hummel Szczepan
Michalewski Henryk
Niwinski Damian
No associations
LandOfFree
On the Borel Inseparability of Game Tree Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Borel Inseparability of Game Tree Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Borel Inseparability of Game Tree Languages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-486714