Deterministic and game separability of tree languages via games

Speaker(s)

Lorenzo Clemente & Michał Skrzypczak

Affiliation

MIM UW & MIM UW

Date

April 21, 2021, 2:15 p.m.

Information about the event

online

Seminar

Seminar Automata Theory

---

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 w-regular winning conditions and applying the finite-memory determinacy theorem of Büchi and Landweber to those games.

---