Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Deterministic and game separability for regular languages of infinite
  trees   We show that it is decidable whether two regular languages of infinite trees
are separable by a deterministic language, resp., a game language. We consider
two variants of separability, depending on whether the set of priorities of the
separator is fixed, or not. In each case, we show that separability can be
decided in EXPTIME, and that separating automata of exponential size suffice.
We obtain our results by reducing to infinite duration games with
{\omega}-regular winning conditions and applying the finite-memory determinacy
theorem of B\"uchi and Landweber.

13
The categories of this paper are: quant-ph
16
The categories of this paper are: stat
34
The categories of this paper are: chem-ph
8
The categories of this paper are: hep-ex
28
The categories of this paper are: alg-geom
15
The categories of this paper are: nucl-ex
24
The categories of this paper are: dg-ga
14
The categories of this paper are: math-ph
22
The categories of this paper are: chao-dyn
5
The categories of this paper are: gr-qc
17
The categories of this paper are: q-fin
37
The categories of this paper are: supr-con
10
The categories of this paper are: q-bio
6
The categories of this paper are: astro-ph
31
The categories of this paper are: ao-sci
4
The categories of this paper are: cond-mat