3 citations · 3 across the 1 of their papers we have counts for
1 paper
Carlos Camino, Volker Diekert, Besik Dundua +2
We study the matching problem of regular tree languages, that is, "∃σ:σ(L)⊆R?" where L,R are regular tree languages over the union of finite ranked alphabets $Σ…