Regular matching problems for infinite trees

Carlos Camino, Volker Diekert, Besik Dundua +2

We study the matching problem of regular tree languages, that is, "$\exists \sigma :\sigma (L)\subseteq R$?" where $L,R$ are regular tree languages over the union of finite ranked alphabets $Σ…