Regular matching problems for infinite trees
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 $\Sigma$ and $\mathcal{X}$ where $\mathcal{X}$ is an alphabet of variables and $\sigma$ is a substitut...
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Article |
| Langue: | English |
| Publié: |
Logical Methods in Computer Science e.V.
2022-02-01
|
| Collection: | Logical Methods in Computer Science |
| Sujets: | |
| Accès en ligne: | https://lmcs.episciences.org/7241/pdf |